AbstractA graph G is called (k, d)*-choosable if, for every list assignment L satisfying |L(v)| = k for all v ϵ V(G), there is an L-coloring of G such that each vertex of G has at most d neighbors colored with the same color as itself. In this note, we prove that every planar graph without 4-cycles and l-cycles for some l ϵ {5, 6, 7} is (3, 1)*-choosable
AbstractA graph G is equitably k-choosable if, for any k-uniform list assignment L, G is L-colorable...
AbstractA list-assignment L to the vertices of G is an assignment of a set L(v) of colors to vertex ...
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 called (k, d)*-choosable if, for every list assignment L satisfying |L(v)| = k ...
A graph G is called (k, d)∗-choosable if, for every list assignment L satisfying |L(v) | = k for al...
AbstractAn L-list coloring of a graph G is a proper vertex coloring in which every vertex v receives...
A graph G is called (k,d)*-choosable if, for every list assignment L satisfying |L(v)| = k for all v...
We study choosability with separation which is a constrained version of list coloring of graphs. A (...
AbstractA graph G is m-choosable with impropriety d, or simply (m,d)∗-choosable, if for every list a...
AbstractAn L-list coloring of a graph G is a proper vertex coloring in which every vertex v receives...
AbstractA graph G = G(V, E) is called L-list colourable if there is a vertex colouring of G in which...
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 is equitably k-choosable if for any k-uniform list assignment L, there exists an L...
AbstractA graph G is called (k,d)∗-choosable if, for every list assignment L with |L(v)|=k for all v...
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 equitably k-choosable if, for any k-uniform list assignment L, G is L-colorable...
AbstractA list-assignment L to the vertices of G is an assignment of a set L(v) of colors to vertex ...
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 called (k, d)*-choosable if, for every list assignment L satisfying |L(v)| = k ...
A graph G is called (k, d)∗-choosable if, for every list assignment L satisfying |L(v) | = k for al...
AbstractAn L-list coloring of a graph G is a proper vertex coloring in which every vertex v receives...
A graph G is called (k,d)*-choosable if, for every list assignment L satisfying |L(v)| = k for all v...
We study choosability with separation which is a constrained version of list coloring of graphs. A (...
AbstractA graph G is m-choosable with impropriety d, or simply (m,d)∗-choosable, if for every list a...
AbstractAn L-list coloring of a graph G is a proper vertex coloring in which every vertex v receives...
AbstractA graph G = G(V, E) is called L-list colourable if there is a vertex colouring of G in which...
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 is equitably k-choosable if for any k-uniform list assignment L, there exists an L...
AbstractA graph G is called (k,d)∗-choosable if, for every list assignment L with |L(v)|=k for all v...
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 equitably k-choosable if, for any k-uniform list assignment L, G is L-colorable...
AbstractA list-assignment L to the vertices of G is an assignment of a set L(v) of colors to vertex ...
AbstractA graph G = G(V, E) is called L-list colourable if there is a vertex colouring of G in which...
DOI
Add to ORKG