2000 character limit reached
A note on 5-cycle double covers (1209.0096v1)
Published 1 Sep 2012 in math.CO
Abstract: The strong cycle double cover conjecture states that for every circuit $C$ of a bridgeless cubic graph $G$, there is a cycle double cover of $G$ which contains $C$. We conjecture that there is even a 5-cycle double cover $S$ of $G$ which contains $C$, i.e. $C$ is a subgraph of one of the five 2-regular subgraphs of $S$. We prove a necessary and sufficient condition for a 2-regular subgraph to be contained in a 5-cycle double cover of $G$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.