Circuit double covers in special types of cubic graphs
From MaRDI portal
Publication:1045063
DOI10.1016/j.disc.2008.05.018zbMath1218.05129OpenAlexW2003321040MaRDI QIDQ1045063
Herbert Fleischner, Roland Haeggkvist
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.05.018
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)
Related Items
Cycle Double Covers in Cubic Graphs having Special Structures, Strong Circuit Double Cover of Some Cubic Graphs, Circuit extension and circuit double cover of graphs, On stable cycles and cycle double covers of graphs with large circumference, Generation and properties of snarks, Unnamed Item, Cycle double covers of infinite planar graphs, Circuit Double Covers of Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Proof of the strong 2-cover conjecture for planar graphs
- Eulersche Linien und Kreisüberdeckungen, die vorgegebene Durchgänge in den Kanten vermeiden
- Eulerian graphs and related topics. Part 1, Volume 1
- Uniquely Hamiltonian Graphs of Minimum Degree 4
- Uniqueness of maximal dominating cycles in 3‐regular graphs and of hamiltonian cycles in 4‐regular graphs
- On Hamiltonian Circuits