activity
20182026
most citedPairwise disjoint perfect matchings in -edge-connected -regular graphs

5 citations · 8 across the 15 of their papers we have counts for

collaborators
Showing 2024Show all

5 papers · 1 filter

math.CO2024

Open problems of the 32nd Workshop on Cycles and Colourings

János Barát, Stijn Cambie, Geňa Hahn +4

Since its beginnings, every Cycles and Colourings workshop holds one or two open problem sessions; this document contains the problems (together with notes regarding the current st…

math.CO2024

On the existence of factors intersecting sets of cycles in regular graphs

Jan Goedgebeur, Davide Mattiolo, Giuseppe Mazzuoccolo +3

A recent result by Kardoš, Máčajová and Zerafa [J. Comb. Theory, Ser. B. 160 (2023) 1--14] related to the famous Berge-Fulkerson conjecture implies that given an arbitrary set of o…

math.CO2024★ 1 cited

Solitude patterns of -graphs via CLM's dependence relation

D. V. V. Narayana, D. Mattiolo, Kalyani Gohokar +1

Recently, Goedgebeur, Mazzuoccolo, Renders, Wolf and the second author [Cubic graphs with edges in exactly one perfect matching, J. Graph Theory 112 (2026), 276-289] proved that ev…

math.CO2024

Cubic graphs with edges in exactly one perfect matching

Jan Goedgebeur, Davide Mattiolo, Giuseppe Mazzuoccolo +2

Petersen's seminal work in 1891 asserts that the edge-set of a cubic graph can be covered by distinct perfect matchings if and only if it is bridgeless. Actually, it is known that…

math.CO2024★ 1 cited

A sharp upper bound for the harmonious total chromatic number of graphs and multigraphs

M. Abreu, J. B. Gauci, D. Mattiolo +4

A proper total colouring of a graph is called harmonious if it has the further property that when replacing each unordered pair of incident vertices and edges with their colour…