Five cycle double covers of some cubic graphs
From MaRDI portal
Publication:1892855
DOI10.1006/jctb.1995.1029zbMath0820.05045OpenAlexW1964324196MaRDI QIDQ1892855
Publication date: 4 July 1995
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1995.1029
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items (38)
Superposition and constructions of graphs without nowhere-zero \(k\)-flows ⋮ 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 ⋮ Negative (and positive) circles in signed graphs: a problem collection ⋮ The construction and reduction of strong snarks ⋮ On Perfect Matching Coverings and Even Subgraph Coverings ⋮ 3-critical subgraphs of snarks ⋮ Cycle Double Covers in Cubic Graphs having Special Structures ⋮ A note on 5-cycle double covers ⋮ On the simultaneous edge coloring of graphs ⋮ Nowhere-zero 4-flows and cycle double covers ⋮ Clin d'oeil on \(L_1\)-embeddable planar graphs ⋮ Strong Circuit Double Cover of Some Cubic Graphs ⋮ On even cycle decompositions of line graphs of cubic graphs ⋮ Circuit extension and circuit double cover of graphs ⋮ Three measures of edge-uncolorability ⋮ Sparsely intersecting perfect matchings in cubic 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 ⋮ Measures of edge-uncolorability of cubic graphs ⋮ 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 ⋮ Double covers of cubic graphs with oddness 4 ⋮ 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 ⋮ Measurements of edge-uncolorability ⋮ Avoiding 5-Circuits in 2-Factors of Cubic Graphs ⋮ Classification and characterizations of snarks ⋮ Circuit Double Covers of Graphs ⋮ Nowhere‐Zero 5‐Flows On Cubic Graphs with Oddness 4
This page was built for publication: Five cycle double covers of some cubic graphs
