activity
20182026
most citedDisjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching

7 citations · 33 across the 16 of their papers we have counts for

collaborators
Showing 2026 · math.COShow all

1 paper · 2 filters

math.CO2026

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,…