L. Esperet

activity

20072026

most citedAcyclic edge-coloring using entropy compression

92 citations · 608 across the 67 of their papers we have counts for

collaborators

Showing 2015 · math.COShow all

6 papers · 2 filters

math.CO2015★ 1 cited

Box representations of embedded graphs

Louis Esperet

A $d$ -box is the cartesian product of $d$ intervals of $R$ and a $d$ -box representation of a graph $G$ is a representation of $G$ as the intersection graph of a set of $d$ …

math.CO2015

Coloring non-crossing strings

Louis Esperet, Daniel Gonçalves, Arnaud Labourel

For a family of geometric objects in the plane $F = {S_{1}, \dots, S_{n}}$ , define $χ (F)$ as the least integer $ℓ$ such that the elements of $F$ can be…

math.CO2015★ 2 cited

The width of quadrangulations of the projective plane

Louis Esperet, Matěj Stehlík

We show that every $4$ -chromatic graph on $n$ vertices, with no two vertex-disjoint odd cycles, has an odd cycle of length at most $\frac{1}{2} (1 + 8 n - 7)$ . Let $G$ be a non-bip…

math.CO2015★ 15 cited

Flows and bisections in cubic graphs

Louis Esperet, Giuseppe Mazzuoccolo, Michael Tarsi

A $k$ -weak bisection of a cubic graph $G$ is a partition of the vertex-set of $G$ into two parts $V_{1}$ and $V_{2}$ of equal size, such that each connected component of the subgraph o…

math.CO2015★ 10 cited

Boxicity and topological invariants

Louis Esperet

The boxicity of a graph $G = (V, E)$ is the smallest integer $k$ for which there exist $k$ interval graphs $G_{i} = (V, E_{i})$ , $1 \leq i \leq k$ , such that $E = E_{1} \cap \dots \cap E_{k}$ . In t…

math.CO2015★ 1 cited

The structure of graphs with Circular flow number 5 or more, and the complexity of their recognition problem

Louis Esperet, Giuseppe Mazzuoccolo, Michael Tarsi

For some time the Petersen graph has been the only known Snark with circular flow number $5$ (or more, as long as the assertion of Tutte's $5$ -flow Conjecture is in doubt). Althoug…