AbstractAn (L,d)∗-coloring is a mapping ϕ that assigns a color ϕ(v)∈L(v) to each vertex v∈V(G) such that at most d neighbors of v receive color ϕ(v). A graph G is called (k,d)∗-choosable if it admits an (L,d)∗-coloring for every list assignment L with |L(v)|≥k for all v∈V(G). Let G be a graph embeddable on the torus. In this paper, it is proved that G is (3,1)∗-choosable if G contains no 5- and 6-cycles
AbstractA graph G is called (k,d)∗-choosable if, for every list assignment L with |L(v)|=k for all v...
A graph G with vertex set V and edge set E is called (a; b)-choosable if for any assignment of lists...
AbstractThis paper starts with a discussion of several old and new conjectures about choosability in...
AbstractAn (L,d)∗-coloring is a mapping ϕ that assigns a color ϕ(v)∈L(v) to each vertex v∈V(G) such ...
summary:A graph $G$ is called $(k,d)^*$-choosable if for every list assignment $L$ satisfying $|L(v)...
summary:A graph $G$ is called $(k,d)^*$-choosable if for every list assignment $L$ satisfying $|L(v)...
AbstractIn this paper, a structural theorem about toroidal graphs is given that strengthens a result...
A graph G is called (k, d)∗-choosable if, for every list assignment L satisfying |L(v) | = k for al...
The choosability χ`(G) of a graph G is the minimum k such that having k colors available at each ver...
A graph G is called (k,d)*-choosable if, for every list assignment L satisfying |L(v)| = k for all v...
AbstractA graph G is called (k, d)*-choosable if, for every list assignment L satisfying |L(v)| = k ...
AbstractA graph G is called (k,d)∗-choosable if, for every list assignment L with |L(v)|=k for all v...
We study choosability with separation which is a constrained version of list coloring of graphs. A (...
It is known that if G is a graph that can be drawn without edges crossing in a surface with Euler ch...
AbstractA list-assignment L to the vertices of G is an assignment of a set L(v) of colors to vertex ...
AbstractA graph G is called (k,d)∗-choosable if, for every list assignment L with |L(v)|=k for all v...
A graph G with vertex set V and edge set E is called (a; b)-choosable if for any assignment of lists...
AbstractThis paper starts with a discussion of several old and new conjectures about choosability in...
AbstractAn (L,d)∗-coloring is a mapping ϕ that assigns a color ϕ(v)∈L(v) to each vertex v∈V(G) such ...
summary:A graph $G$ is called $(k,d)^*$-choosable if for every list assignment $L$ satisfying $|L(v)...
summary:A graph $G$ is called $(k,d)^*$-choosable if for every list assignment $L$ satisfying $|L(v)...
AbstractIn this paper, a structural theorem about toroidal graphs is given that strengthens a result...
A graph G is called (k, d)∗-choosable if, for every list assignment L satisfying |L(v) | = k for al...
The choosability χ`(G) of a graph G is the minimum k such that having k colors available at each ver...
A graph G is called (k,d)*-choosable if, for every list assignment L satisfying |L(v)| = k for all v...
AbstractA graph G is called (k, d)*-choosable if, for every list assignment L satisfying |L(v)| = k ...
AbstractA graph G is called (k,d)∗-choosable if, for every list assignment L with |L(v)|=k for all v...
We study choosability with separation which is a constrained version of list coloring of graphs. A (...
It is known that if G is a graph that can be drawn without edges crossing in a surface with Euler ch...
AbstractA list-assignment L to the vertices of G is an assignment of a set L(v) of colors to vertex ...
AbstractA graph G is called (k,d)∗-choosable if, for every list assignment L with |L(v)|=k for all v...
A graph G with vertex set V and edge set E is called (a; b)-choosable if for any assignment of lists...
AbstractThis paper starts with a discussion of several old and new conjectures about choosability in...
DOI
Add to ORKG