Add to ORKGBased on the algorithmic proof of Lovász local lemma due to Moser and Tardos, Esperet and Parreau developed a framework to prove upper bounds for several chromatic numbers (in particular acyclic chromatic index, star chromatic number and Thue chromatic number) using the so-called entropy compression method. Inspired by this work, we propose a more general framework and a better analysis. This leads to improved upper bounds on chromatic numbers and indices. In particular, every graph with maximum degree ∆ has an acyclic chromatic number at most 3
A vertex colouring of a graph is nonrepetitive if there is no path whose first half receives the sam...
AbstractWe give a new upper bound on the total chromatic number of a graph. This bound improves the ...
A vertex colouring of a graph is nonrepetitive if there is no path whose first half receives the sam...
International audienceWe propose a new proof technique that applies to the same problems as the Lová...
International audienceAn edge-coloring of a graph G is acyclic if it is a proper edge-coloring of G ...
Presented on October 20, 2017 at 11:00 a.m. in the Skiles Classroom Building, room 005.Mike Molloy i...
We study properties of graph colorings that minimize the quantity of color information with respect ...
The acyclic chromatic number of a graph is the least number of colors needed to properly color its v...
A star edge coloring is any edge coloring which is both proper and contains no cycles or path of len...
Abstract. We present an algorithmic approach to solving the problem of chromatic entropy, a combinat...
The local chromatic number of a graph is a coloring invariant introduced in 1986 by Erd ̋os, Fu ̈red...
An area in graph theory is graph colouring, which essentially is a labeling of the vertices or edges...
International audienceWe prove that the acyclic chromatic number of a graph with maximum degree ∆ is...
Abstract — We study properties of graph colorings that minimize the quantity of color information wi...
The clique chromatic number of a graph is the minimum number of colours needed to colour its vertice...
A vertex colouring of a graph is nonrepetitive if there is no path whose first half receives the sam...
AbstractWe give a new upper bound on the total chromatic number of a graph. This bound improves the ...
A vertex colouring of a graph is nonrepetitive if there is no path whose first half receives the sam...
International audienceWe propose a new proof technique that applies to the same problems as the Lová...
International audienceAn edge-coloring of a graph G is acyclic if it is a proper edge-coloring of G ...
Presented on October 20, 2017 at 11:00 a.m. in the Skiles Classroom Building, room 005.Mike Molloy i...
We study properties of graph colorings that minimize the quantity of color information with respect ...
The acyclic chromatic number of a graph is the least number of colors needed to properly color its v...
A star edge coloring is any edge coloring which is both proper and contains no cycles or path of len...
Abstract. We present an algorithmic approach to solving the problem of chromatic entropy, a combinat...
The local chromatic number of a graph is a coloring invariant introduced in 1986 by Erd ̋os, Fu ̈red...
An area in graph theory is graph colouring, which essentially is a labeling of the vertices or edges...
International audienceWe prove that the acyclic chromatic number of a graph with maximum degree ∆ is...
Abstract — We study properties of graph colorings that minimize the quantity of color information wi...
The clique chromatic number of a graph is the minimum number of colours needed to colour its vertice...
A vertex colouring of a graph is nonrepetitive if there is no path whose first half receives the sam...
AbstractWe give a new upper bound on the total chromatic number of a graph. This bound improves the ...
A vertex colouring of a graph is nonrepetitive if there is no path whose first half receives the sam...