AbstractLet G be a graph and χl(G) denote the list chromatic number of G. In this paper we prove that for every graph G for which the length of each cycle is divisible by l (l≥3), χl(G)≤3
AbstractIf L is a list assignment of colors to the vertices of a graph G of chromatic number χ(G), a...
AbstractOne of the authors has conjectured that every graph G with 2χ(G)+1 or fewer vertices is χ(G)...
AbstractGiven a graph G = (V,E) and a finite set L(v) at each vertex v ϵ V, the List Coloring proble...
International audienceThe dichromatic number χ(D) of a digraph D is the least number k such that the...
AbstractWe prove that, if a graph has a list of k available colors at every vertex, then the number ...
AbstractA well-established generalization of graph coloring is the concept of list coloring. In this...
List packing is a notion that was introduced in 2021 (by Cambie et al.). The list packing number of ...
The chromatic polynomial of a graph $G$, denoted $P(G,m)$, is equal to the number of proper $m$-colo...
This thesis studies both several extremal problems about coloring of graphs and a labeling problem o...
We prove that the list-chromatic index and paintability index of K"6 is 5. That indeed @g"@?^'(K"6)=...
AbstractThe first author showed that the list chromatic number of every graph with average degree d ...
AbstractFor large values of Δ, it is shown that all Δ-regular finite simple graphs possess a non-tri...
A list colouring problem asks the following: given an assignment of lists L(v) of colours to each ve...
Suppose ch(G) and X(G) denote, respectively, the choice number and the chromatic number of a graph G...
List coloring is a vertex coloring of a graph where each vertex can be restricted to a list of allow...
AbstractIf L is a list assignment of colors to the vertices of a graph G of chromatic number χ(G), a...
AbstractOne of the authors has conjectured that every graph G with 2χ(G)+1 or fewer vertices is χ(G)...
AbstractGiven a graph G = (V,E) and a finite set L(v) at each vertex v ϵ V, the List Coloring proble...
International audienceThe dichromatic number χ(D) of a digraph D is the least number k such that the...
AbstractWe prove that, if a graph has a list of k available colors at every vertex, then the number ...
AbstractA well-established generalization of graph coloring is the concept of list coloring. In this...
List packing is a notion that was introduced in 2021 (by Cambie et al.). The list packing number of ...
The chromatic polynomial of a graph $G$, denoted $P(G,m)$, is equal to the number of proper $m$-colo...
This thesis studies both several extremal problems about coloring of graphs and a labeling problem o...
We prove that the list-chromatic index and paintability index of K"6 is 5. That indeed @g"@?^'(K"6)=...
AbstractThe first author showed that the list chromatic number of every graph with average degree d ...
AbstractFor large values of Δ, it is shown that all Δ-regular finite simple graphs possess a non-tri...
A list colouring problem asks the following: given an assignment of lists L(v) of colours to each ve...
Suppose ch(G) and X(G) denote, respectively, the choice number and the chromatic number of a graph G...
List coloring is a vertex coloring of a graph where each vertex can be restricted to a list of allow...
AbstractIf L is a list assignment of colors to the vertices of a graph G of chromatic number χ(G), a...
AbstractOne of the authors has conjectured that every graph G with 2χ(G)+1 or fewer vertices is χ(G)...
AbstractGiven a graph G = (V,E) and a finite set L(v) at each vertex v ϵ V, the List Coloring proble...
DOI
Add to ORKG