This paper studies the choice number and paint number of the lexicographic product of graphs. We prove that if G has maximum degree Δ, then for any graph H on n vertices ch(G[H])≤(4Δ+2)(ch(H)+log2n) and χP(G[H])≤(4Δ+2)(χP(H)+log2n). © 2017 Elsevier B.V
AbstractA graph G is said to be f-choosable if there exists a proper coloring from every assignment ...
International audienceIn this paper, the on-line list colouring of binomial random graphs G (n, p) i...
c©Jonathan A. Noel, 2013 The choice number of a graph G, denoted ch(G), is the minimum integer k suc...
We study several problems in graph coloring. In list coloring, each vertex $v$ has a set $L(v)$ of ...
AbstractA graph is on-line chromatic choosable if its on-line choice number equals its chromatic num...
Suppose ch(G) and X(G) denote, respectively, the choice number and the chromatic number of a graph G...
AbstractIn this paper, we determine the exact values of the game chromatic number of lexicographic p...
Let f:V→N be a function on the vertex set of the graph G=(V,E). The graph G is f-choosable if for ev...
AbstractA well-established generalization of graph coloring is the concept of list coloring. In this...
In this thesis we study list coloring which was introduced independently by Vizing and Erd˝os, Rubin...
The choice number of a graph G, denoted ch(G), is the minimum integer k such that for any assignment...
DP-coloring (also called correspondence coloring) is a generalization of list coloring introduced by...
Erdos, Rubin and Taylor showed in 1979 that for any connected graph G which is not a complete graph ...
AbstractOne of the authors has conjectured that every graph G with 2χ(G)+1 or fewer vertices is χ(G)...
AbstractWe characterize the graphs G such that Ch(G)+Ch(Ḡ)=n+1, where Ch(G) is the choice number (l...
AbstractA graph G is said to be f-choosable if there exists a proper coloring from every assignment ...
International audienceIn this paper, the on-line list colouring of binomial random graphs G (n, p) i...
c©Jonathan A. Noel, 2013 The choice number of a graph G, denoted ch(G), is the minimum integer k suc...
We study several problems in graph coloring. In list coloring, each vertex $v$ has a set $L(v)$ of ...
AbstractA graph is on-line chromatic choosable if its on-line choice number equals its chromatic num...
Suppose ch(G) and X(G) denote, respectively, the choice number and the chromatic number of a graph G...
AbstractIn this paper, we determine the exact values of the game chromatic number of lexicographic p...
Let f:V→N be a function on the vertex set of the graph G=(V,E). The graph G is f-choosable if for ev...
AbstractA well-established generalization of graph coloring is the concept of list coloring. In this...
In this thesis we study list coloring which was introduced independently by Vizing and Erd˝os, Rubin...
The choice number of a graph G, denoted ch(G), is the minimum integer k such that for any assignment...
DP-coloring (also called correspondence coloring) is a generalization of list coloring introduced by...
Erdos, Rubin and Taylor showed in 1979 that for any connected graph G which is not a complete graph ...
AbstractOne of the authors has conjectured that every graph G with 2χ(G)+1 or fewer vertices is χ(G)...
AbstractWe characterize the graphs G such that Ch(G)+Ch(Ḡ)=n+1, where Ch(G) is the choice number (l...
AbstractA graph G is said to be f-choosable if there exists a proper coloring from every assignment ...
International audienceIn this paper, the on-line list colouring of binomial random graphs G (n, p) i...
c©Jonathan A. Noel, 2013 The choice number of a graph G, denoted ch(G), is the minimum integer k suc...
DOI
Add to ORKG