Cycle Double Covers via Kotzig Graphs
classification
🧮 math.CO
keywords
cycleeverycomponentconnecteddoublegraphkotzigcertain
read the original abstract
We show that every $2$-connected cubic graph $G$ has a cycle double cover if $G$ has a spanning subgraph $F$ such that (i) every component of $F$ has an even number of vertices (ii) every component of $F$ is either a cycle or a subdivision of a Kotzig graph and (iii) the components of $F$ are connected to each other in a certain general manner.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.