Add to ORKG10 pagesA graph $G$ is $(a,b)$-choosable if for any color list of size $a$ associated with each vertices, one can choose a subset of $b$ colors such that adjacent vertices are colored with disjoint color sets. This paper shows an equivalence between the $(a,b)$-choosability of a graph and the $(a,b)$-choosability of one of its subgraphs called the extended core. As an application, this result allows to prove the $(5,2)$-choosability and $(7,3)$-colorability of triangle-free induced subgraphs of the triangular lattice
A (k, t)-list assignment L of a graph G is a mapping which assigns a set of size k to each vertex v ...
AbstractA graph G is said to be chromatic-choosable if ch(G)=χ(G). Ohba has conjectured that every g...
AbstractIt is proved that if G is a plane embedding of a K4-minor-free graph with maximum degree Δ, ...
International audienceA graph $G$ is $(a,b)$-choosable if for any color list of size $a$ associated ...
International audienceA graph $G$ is free $(a,b)$-choosable if for any vertex $v$ with $b$ colors as...
International audienceA graph G is free (a, b)-choosable if for any vertex v with b colors assigned ...
A graph G is k-choosable if its vertices can be colored from any lists L(v) of colors with jL(v)j ...
We study choosability with separation which is a constrained version of list coloring of graphs. A (...
A graph is k-choosable if it can be colored whenever every vertex has a list of available colors of ...
It is known that if G is a graph that can be drawn without edges crossing in a surface with Euler ch...
A graph G with vertex set V and edge set E is called (a; b)-choosable if for any assignment of lists...
summary:A graph $G$ is called $(k,d)^*$-choosable if for every list assignment $L$ satisfying $|L(v)...
A graph G is called (k, d)∗-choosable if, for every list assignment L satisfying |L(v) | = k for al...
AbstractA graph G is (a, b)-choosable if for any assignment of a list of a colors to each of its ver...
AbstractA graph G = G(V, E) with lists L(v), associated with its vertices v ∈ V, is called L-list co...
A (k, t)-list assignment L of a graph G is a mapping which assigns a set of size k to each vertex v ...
AbstractA graph G is said to be chromatic-choosable if ch(G)=χ(G). Ohba has conjectured that every g...
AbstractIt is proved that if G is a plane embedding of a K4-minor-free graph with maximum degree Δ, ...
International audienceA graph $G$ is $(a,b)$-choosable if for any color list of size $a$ associated ...
International audienceA graph $G$ is free $(a,b)$-choosable if for any vertex $v$ with $b$ colors as...
International audienceA graph G is free (a, b)-choosable if for any vertex v with b colors assigned ...
A graph G is k-choosable if its vertices can be colored from any lists L(v) of colors with jL(v)j ...
We study choosability with separation which is a constrained version of list coloring of graphs. A (...
A graph is k-choosable if it can be colored whenever every vertex has a list of available colors of ...
It is known that if G is a graph that can be drawn without edges crossing in a surface with Euler ch...
A graph G with vertex set V and edge set E is called (a; b)-choosable if for any assignment of lists...
summary:A graph $G$ is called $(k,d)^*$-choosable if for every list assignment $L$ satisfying $|L(v)...
A graph G is called (k, d)∗-choosable if, for every list assignment L satisfying |L(v) | = k for al...
AbstractA graph G is (a, b)-choosable if for any assignment of a list of a colors to each of its ver...
AbstractA graph G = G(V, E) with lists L(v), associated with its vertices v ∈ V, is called L-list co...
A (k, t)-list assignment L of a graph G is a mapping which assigns a set of size k to each vertex v ...
AbstractA graph G is said to be chromatic-choosable if ch(G)=χ(G). Ohba has conjectured that every g...
AbstractIt is proved that if G is a plane embedding of a K4-minor-free graph with maximum degree Δ, ...