73 citations · 785 across the 86 of their papers we have counts for
5 papers · 2 filters
Nonrepetitive Colouring via Entropy Compression
Vida Dujmović, Gwenaël Joret, Jakub Kozik +1
A vertex colouring of a graph is \emph{nonrepetitive} if there is no path whose first half receives the same sequence of colours as the second half. A graph is nonrepetitively -…
An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains
Vida Dujmović, Gwenaël Joret, David R. Wood
It is known that the First-Fit algorithm for partitioning a poset P into chains uses relatively few chains when P does not have two incomparable chains each of size k. In particula…
Disproof of the List Hadwiger Conjecture
János Barát, Gwenaël Joret, David R. Wood
The List Hadwiger Conjecture asserts that every -minor-free graph is -choosable. We disprove this conjecture by constructing a -minor-free graph that is not -…
Boxicity of graphs on surfaces
Louis Esperet, Gwenaël Joret
The boxicity of a graph is the least integer for which there exist interval graphs , , such that . Scheinerma…
Complete Graph Minors and the Graph Minor Structure Theorem
Gwenaël Joret, David R. Wood
The graph minor structure theorem by Robertson and Seymour shows that every graph that excludes a fixed minor can be constructed by a combination of four ingredients: graphs embedd…