Abstract
Which 2-regular subgraph R of a cubic graph G can be extended to a cycle double cover of G? We provide a condition which ensures that every R satisfying this condition is part of a cycle double cover of G. As one consequence, we prove that every 2-connected cubic graph which has a decomposition into a spanning tree and a 2-regular subgraph C consisting of k circuits with k≤3, has a cycle double cover containing C.
| Original language | English |
|---|---|
| Pages (from-to) | 276-284 |
| Number of pages | 9 |
| Journal | European Journal of Combinatorics |
| Volume | 81 |
| DOIs | |
| Publication status | Published - Oct 2019 |
| Externally published | Yes |
Fingerprint
Dive into the research topics of 'Cycle double covers and non-separating cycles'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver