AbstractA graph G is equitably k-choosable if for any k-uniform list assignment L, there exists an L-colorable of G such that each color appears on at most ⌈|V(G)|k⌉ vertices. Kostochka, Pelsmajer and West introduced this notion and conjectured that G is equitably k-choosable for k>Δ(G). We prove this for planar graphs with Δ(G)≥6 and no 4- or 6-cycles
We study choosability with separation which is a constrained version of list coloring of graphs. A (...
In 2003 Kostochka, Pelsmajer, and West introduced a list analogue of equitable coloring called equit...
A graph G is called (k, d)∗-choosable if, for every list assignment L satisfying |L(v) | = k for al...
AbstractA graph G is equitably k-choosable if, for any k-uniform list assignment L, G is L-colorable...
AbstractA graph G is equitably k-choosable if for any k-uniform list assignment L, there exists an L...
A graph G is equitably k-choosable if for any k-uniform list assignment L, G is L-colorable and each...
AbstractA graph G is equitably k-choosable if, for any k-uniform list assignment L, G is L-colorable...
AbstractA graph G = G(V, E) is called L-list colourable if there is a vertex colouring of G in which...
AbstractA proper k-vertex coloring of a graph is an equitable k-coloring if the sizes of the color c...
AbstractA graph G=G(V,E) is called L-list colourable if there is a vertex colouring of G in which th...
AbstractA graph G = G(V, E) with lists L(v), associated with its vertices v ∈ V, is called L-list co...
AbstractA graph G is called (k, d)*-choosable if, for every list assignment L satisfying |L(v)| = k ...
AbstractA proper vertex coloring of a graph G=(V,E) is acyclic if G contains no bicolored cycle. Giv...
A graph is said to be equitably k-colorable if the vertex set V (G) can be partitioned into k indepe...
AbstractAn L-list coloring of a graph G is a proper vertex coloring in which every vertex v receives...
We study choosability with separation which is a constrained version of list coloring of graphs. A (...
In 2003 Kostochka, Pelsmajer, and West introduced a list analogue of equitable coloring called equit...
A graph G is called (k, d)∗-choosable if, for every list assignment L satisfying |L(v) | = k for al...
AbstractA graph G is equitably k-choosable if, for any k-uniform list assignment L, G is L-colorable...
AbstractA graph G is equitably k-choosable if for any k-uniform list assignment L, there exists an L...
A graph G is equitably k-choosable if for any k-uniform list assignment L, G is L-colorable and each...
AbstractA graph G is equitably k-choosable if, for any k-uniform list assignment L, G is L-colorable...
AbstractA graph G = G(V, E) is called L-list colourable if there is a vertex colouring of G in which...
AbstractA proper k-vertex coloring of a graph is an equitable k-coloring if the sizes of the color c...
AbstractA graph G=G(V,E) is called L-list colourable if there is a vertex colouring of G in which th...
AbstractA graph G = G(V, E) with lists L(v), associated with its vertices v ∈ V, is called L-list co...
AbstractA graph G is called (k, d)*-choosable if, for every list assignment L satisfying |L(v)| = k ...
AbstractA proper vertex coloring of a graph G=(V,E) is acyclic if G contains no bicolored cycle. Giv...
A graph is said to be equitably k-colorable if the vertex set V (G) can be partitioned into k indepe...
AbstractAn L-list coloring of a graph G is a proper vertex coloring in which every vertex v receives...
We study choosability with separation which is a constrained version of list coloring of graphs. A (...
In 2003 Kostochka, Pelsmajer, and West introduced a list analogue of equitable coloring called equit...
A graph G is called (k, d)∗-choosable if, for every list assignment L satisfying |L(v) | = k for al...
DOI
Add to ORKG