92 citations · 608 across the 67 of their papers we have counts for
4 papers · 2 filters
Bipartite complements of circle graphs
Louis Esperet, Matěj Stehlík
Using an algebraic characterization of circle graphs, Bouchet proved in 1999 that if a bipartite graph is the complement of a circle graph, then is a circle graph. We give…
Planar graphs have bounded nonrepetitive chromatic number
Vida Dujmović, Louis Esperet, Gwenaël Joret +2
A colouring of a graph is "nonrepetitive" if for every path of even order, the sequence of colours on the first half of the path is different from the sequence of colours on the se…
Local approximation of the Maximum Cut in regular graphs
Étienne Bamas, Louis Esperet
This paper is devoted to the distributed complexity of finding an approximation of the maximum cut in graphs. A classical algorithm consists in letting each vertex choose its side…
Coloring graphs with no induced subdivision of
Louis Esperet, Nicolas Trotignon
Let be the 5-vertex graph obtained from , the complete graph on four vertices, by subdividing one edge precisely once (i.e. by replacing one edge by a path on three ve…