Cycle Double Covers via Kotzig Graphs
Combinatorics
2017-01-24 v2
Abstract
We show that every -connected cubic graph has a cycle double cover if has a spanning subgraph such that (i) every component of has an even number of vertices (ii) every component of is either a cycle or a subdivision of a Kotzig graph and (iii) the components of are connected to each other in a certain general manner.
Keywords
Cite
@article{arxiv.1701.05844,
title = {Cycle Double Covers via Kotzig Graphs},
author = {Herbert Fleischner and Roland Häggkvist and Arthur Hoffmann-Ostenhof},
journal= {arXiv preprint arXiv:1701.05844},
year = {2017}
}