92 citations · 608 across the 67 of their papers we have counts for
4 papers · 2 filters
On the maximum fraction of edges covered by t perfect matchings in a cubic bridgeless graph
Louis Esperet, Giuseppe Mazzuoccolo
A conjecture of Berge and Fulkerson (1971) states that every cubic bridgeless graph contains 6 perfect matchings covering each edge precisely twice, which easily implies that every…
Distance-two coloring of sparse graphs
Zdenek Dvorak, Louis Esperet
Consider a graph and, for each vertex , a subset of neighbors of . A -coloring is a coloring of the elements of so that vertices appearing to…
Coloring planar graphs with three colors and no large monochromatic components
Louis Esperet, Gwenaël Joret
We prove the existence of a function such that the vertices of every planar graph with maximum degree can be 3-colored in such a way that each mo…
On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings
Louis Esperet, Giuseppe Mazzuoccolo
The problem of establishing the number of perfect matchings necessary to cover the edge-set of a cubic bridgeless graph is strictly related to a famous conjecture of Berge and Fulk…