Double covers of cubic graphs with oddness 4
From MaRDI portal
Publication:1767671
DOI10.1016/j.jctb.2004.11.003zbMath1056.05114OpenAlexW2165273484MaRDI QIDQ1767671
Sean McGuinness, Roland Haeggkvist
Publication date: 8 March 2005
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2004.11.003
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)
Related Items (24)
Snarks with resistance \(n\) and flow resistance \(2n\) ⋮ 5-Cycle Double Covers, 4-Flows, and Catlin Reduction ⋮ On snarks that are far from being 3-edge colorable ⋮ Oddness to resistance ratios in cubic graphs ⋮ Cycle Double Covers in Cubic Graphs having Special Structures ⋮ On the simultaneous edge coloring of graphs ⋮ Strong Circuit Double Cover of Some Cubic Graphs ⋮ Circuit extension and circuit double cover of graphs ⋮ Cycle double covers and the semi-Kotzig frame ⋮ On stable cycles and cycle double covers of graphs with large circumference ⋮ Even cycle decompositions of 4-regular graphs and line graphs ⋮ On 2-factors with a bounded number of odd components ⋮ Generation and properties of snarks ⋮ Perfect matching covers of cubic graphs of oddness 2 ⋮ Weak oddness as an approximation of oddness and resistance in cubic graphs ⋮ Snarks with large oddness and small number of vertices ⋮ Small snarks with large oddness ⋮ Cycle double covers and spanning minors. I ⋮ Cycle double covers and spanning minors. II ⋮ The smallest nontrivial snarks of oddness 4 ⋮ Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44 ⋮ Avoiding 5-Circuits in 2-Factors of Cubic Graphs ⋮ Circuit Double Covers of Graphs ⋮ Nowhere‐Zero 5‐Flows On Cubic Graphs with Oddness 4
Cites Work
- Unnamed Item
- Unnamed Item
- Cycle double covers of graphs with Hamilton paths
- Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen
- Five cycle double covers of some cubic graphs
- A survey on snarks and new results: Products, reducibility and a computer search
- On cycle-double covers of graphs of small oddness
This page was built for publication: Double covers of cubic graphs with oddness 4
