Back to Search
Start Over
Cycle double covers via Kotzig graphs.
- Source :
-
Journal of Combinatorial Theory - Series B . Mar2019, Vol. 135, p212-226. 15p. - Publication Year :
- 2019
-
Abstract
- 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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00958956
- Volume :
- 135
- Database :
- Academic Search Index
- Journal :
- Journal of Combinatorial Theory - Series B
- Publication Type :
- Academic Journal
- Accession number :
- 133826662
- Full Text :
- https://doi.org/10.1016/j.jctb.2018.08.005