activity
20112025
most citedOn cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings

21 citations · 92 across the 33 of their papers we have counts for

collaborators
Showing 2016Show all

2 papers · 1 filter

math.CO2016

Cores, joins and the Fano-flow conjectures

Ligang Jin, Giuseppe Mazzuoccolo, Eckhard Steffen

The Fan-Raspaud Conjecture states that every bridgeless cubic graph has three 1-factors with empty intersection. A weaker one than this conjecture is that every bridgeless cubic gr…

math.CO2016

Treelike snarks

Marién Abreu, Tomas Kaiser, Domenico Labbate +1

We study snarks whose edges cannot be covered by fewer than five perfect matchings. Esperet and Mazzuoccolo found an infinite family of such snarks, generalising an example provide…