J. P. Zerafa

A tris of perfect matchings in bridgeless claw-free cubic graphs

A proof of the cycle double cover conjecture was recently announced, yielding an $8$-cycle double cover for every bridgeless graph. The stronger $5$-cycle double cover conjecture, which is still open, is equivalent to the statement that the edge set of every bridgeless claw-free cubic graph can be covered by at most fo...