<div class="csl-bib-body">
<div class="csl-entry">Fleischner, H., Häggkvist, R., & Hoffmann-Ostenhof, A. (2019). Cycle Double Covers via Kotzig Graphs. <i>Journal of Combinatorial Theory, Series B</i>, <i>135</i>, 212–226. https://doi.org/10.1016/j.jctb.2018.08.005</div>
</div>
-
dc.identifier.issn
0095-8956
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/145497
-
dc.description.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.