AbstractA general type of edge colorings is described which includes many known colorings. Necessary and sufficient conditions for bicolorability are established by using simple alternating chain methods. Sufficient conditions for k-colorability are then stated. The first type of condition consists of excluding obstructions (i.e., non-bicolorable partial graphs) from the graph; the second type of condition requires some topological properties for the obstructions
A hypergraph is properly 2-colorable if each vertex can be colored by one of two colors and no edge ...
AbstractWe investigate graph colorings that satisfy the restraint that the color assigned to a given...
A graph is (k; d)-colorable if one can color the vertices with k colors such that no vertex is adjac...
AbstractA general type of edge colorings is described which includes many known colorings. Necessary...
AbstractA general framework for coloring problems is described; the concept of regular coloring is i...
A classical result from graph theory states that the edges of an l--regular bipartite graph can be c...
We study the graph coloring problem under two kinds of simultaneous restrictions. First we forbid so...
We explore four kinds of edge colorings defined by the requirement of equal number of colors appeari...
AbstractA classical result from graph theory states that the edges of an l-regular bipartite graph c...
The problem of edge-coloring a bipartite graph is to color the edges so that adjacent edges receive ...
A uniform hypergraph is properly k-colorable if each vertex is colored by one of k colors and no edg...
A comprehensive treatment of color-induced graph colorings is presented in this book, emphasizing ve...
For a positive integer k, a k-colouring of a graph G = (V,E) is a mapping c: V → {1, 2,..., k} such ...
AbstractWe consider the following conjecture:Let G be a k-regular simple graph with an even number n...
A uniform hypergraph is properly k-colorable if each vertex is colored by one of k colors and no edg...
A hypergraph is properly 2-colorable if each vertex can be colored by one of two colors and no edge ...
AbstractWe investigate graph colorings that satisfy the restraint that the color assigned to a given...
A graph is (k; d)-colorable if one can color the vertices with k colors such that no vertex is adjac...
AbstractA general type of edge colorings is described which includes many known colorings. Necessary...
AbstractA general framework for coloring problems is described; the concept of regular coloring is i...
A classical result from graph theory states that the edges of an l--regular bipartite graph can be c...
We study the graph coloring problem under two kinds of simultaneous restrictions. First we forbid so...
We explore four kinds of edge colorings defined by the requirement of equal number of colors appeari...
AbstractA classical result from graph theory states that the edges of an l-regular bipartite graph c...
The problem of edge-coloring a bipartite graph is to color the edges so that adjacent edges receive ...
A uniform hypergraph is properly k-colorable if each vertex is colored by one of k colors and no edg...
A comprehensive treatment of color-induced graph colorings is presented in this book, emphasizing ve...
For a positive integer k, a k-colouring of a graph G = (V,E) is a mapping c: V → {1, 2,..., k} such ...
AbstractWe consider the following conjecture:Let G be a k-regular simple graph with an even number n...
A uniform hypergraph is properly k-colorable if each vertex is colored by one of k colors and no edg...
A hypergraph is properly 2-colorable if each vertex can be colored by one of two colors and no edge ...
AbstractWe investigate graph colorings that satisfy the restraint that the color assigned to a given...
A graph is (k; d)-colorable if one can color the vertices with k colors such that no vertex is adjac...
DOI
Add to ORKG