Counting Small Cycle Double Covers

Jorik Jooken, Ben Seamone, Carol T. Zamfirescu

A theorem due to Seyffarth states that every planar $4$-connected $n$-vertex graph has a cycle double cover (CDC) containing at most $n-1$ cycles (a "small" CDC). We extend this th…