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 2014Show all

2 papers · 1 filter

math.CO2014

Nowhere-zero 5-flows on cubic graphs with oddness 4

Giuseppe Mazzuoccolo, Eckhard Steffen

Tutte's 5-Flow Conjecture from 1954 states that every bridgeless graph has a nowhere-zero 5-flow. In 2004, Kochol proved that the conjecture is equivalent to its restriction on cyc…

math.CO2014★ 5 cited

3-regular matchstick graphs with given girth

Sascha Kurz, Giuseppe Mazzuoccolo

We consider 3-regular planar matchstick graphs, i.e. those which have a planar embedding such that all edge lengths are equal, with given girth g. For girth 3 it is known that such…