7 citations · 17 across the 12 of their papers we have counts for
17 papers
A tris of perfect matchings in bridgeless claw-free cubic graphs
Jean Paul Zerafa
A proof of the cycle double cover conjecture was recently announced, yielding an -cycle double cover for every bridgeless graph. The stronger -cycle double cover conjecture,…
Three-cuts are a charm: acyclicity in 3-connected cubic graphs
František Kardoš, Edita Máčajová, Jean Paul Zerafa
Let be a bridgeless cubic graph. In 2023, the three authors solved a conjecture (also known as the -Conjecture) made by Mazzuoccolo in 2013: there exist two perfect matchi…
The Pairing-Hamiltonian property in graph prisms
Marién Abreu, Giuseppe Mazzuoccolo, Federico Romaniello +1
Let be a graph of even order, and consider as the complete graph on the same vertex set as . A perfect matching of is called a pairing of . If for every pairi…
Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching
František Kardoš, Edita Máčajová, Jean Paul Zerafa
Let be a bridgeless cubic graph. The Berge--Fulkerson Conjecture (1970s) states that admits a list of six perfect matchings such that each edge of belongs to exactly tw…
On two graph isomorphism problems
John Baptist Gauci, Jean Paul Zerafa
In 2015, Bogdanowicz gave a necessary and sufficient condition for a 4-regular circulant graph to be isomorphic to the Cartesian product of two cycles. Accordion graphs, denoted by…
On the existence of graphs which can colour every regular graph
Giuseppe Mazzuoccolo, Gloria Tabarelli, Jean Paul Zerafa
Let and be graphs. An -colouring of is a proper edge-colouring such that for any vertex there exists a vertex with $…