Add to ORKGA graph G is equitably k-choosable if for any k-uniform list assignment L, G is L-colorable and each color appears on at most djV(G)j=ke vertices. A graph G is equitable kcolorable if G has a proper vertex coloring with k colors such that the size of the color classes differ by at most 1. In this paper, we prove that if G is a planar graph without 5- and 7-cycles, then G is equitably k-choosable and equitably k-colorable where k maxfD(G)7g
AbstractA graph G=G(V,E) is called L-list colourable if there is a vertex colouring of G in which th...
AbstractThe present paper studies the following variation of vertex coloring on graphs. A graph G is...
AbstractA graph G = G(V, E) is called L-list colourable if there is a vertex colouring of G in which...
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...
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...
AbstractA proper k-vertex coloring of a graph is an equitable k-coloring if the sizes of the color c...
A graph is said to be equitably k-colorable if the vertex set V (G) can be partitioned into k indepe...
Abstract In this paper, we prove that if G is a planar graph with maximum degree ∆ ≥ 7 and without ...
In 2003 Kostochka, Pelsmajer, and West introduced a list analogue of equitable coloring called equit...
AbstractA proper vertex coloring of a graph G is equitable if the size of color classes differ by at...
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) with lists L(v), associated with its vertices v ∈ V, is called L-list co...
A graph G is edge-L-colorable if for a given edge assignment L = {L(e) : e ∈ E(G)}, there exists a p...
AbstractA graph G=G(V,E) is called L-list colourable if there is a vertex colouring of G in which th...
AbstractThe present paper studies the following variation of vertex coloring on graphs. A graph G is...
AbstractA graph G = G(V, E) is called L-list colourable if there is a vertex colouring of G in which...
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...
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...
AbstractA proper k-vertex coloring of a graph is an equitable k-coloring if the sizes of the color c...
A graph is said to be equitably k-colorable if the vertex set V (G) can be partitioned into k indepe...
Abstract In this paper, we prove that if G is a planar graph with maximum degree ∆ ≥ 7 and without ...
In 2003 Kostochka, Pelsmajer, and West introduced a list analogue of equitable coloring called equit...
AbstractA proper vertex coloring of a graph G is equitable if the size of color classes differ by at...
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) with lists L(v), associated with its vertices v ∈ V, is called L-list co...
A graph G is edge-L-colorable if for a given edge assignment L = {L(e) : e ∈ E(G)}, there exists a p...
AbstractA graph G=G(V,E) is called L-list colourable if there is a vertex colouring of G in which th...
AbstractThe present paper studies the following variation of vertex coloring on graphs. A graph G is...
AbstractA graph G = G(V, E) is called L-list colourable if there is a vertex colouring of G in which...