21 citations · 92 across the 33 of their papers we have counts for
4 papers · 1 filter
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…
Excessive [l,m]-factorizations
David Cariolaro, Giuseppe Mazzuoccolo
Given two positive integers l and m, with l \le m, an [l,m]-covering of a graph G is a set M of matchings of G whose union is the edge set of G and such that l \le |L| \le m for ev…
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…
On the excessive [m]-index of a tree
Giuseppe Mazzuoccolo
The excessive [m]-index of a graph G is the minimum number of matchings of size m needed to cover the edge-set of G. We call a graph G [m]-coverable if its excessive [m]-index is f…