On cycle-double covers of graphs of small oddness

DOI10.1016/S0012-365X(00)00205-3zbMath0982.05081OpenAlexW2077999329WikidataQ126310957 ScholiaQ126310957MaRDI QIDQ5931449

Andreas Huck

Publication date: 8 April 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00205-3

zbMATH Keywords

bridgeless graphcycle-double coversoddness

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

5-Cycle Double Covers, 4-Flows, and Catlin Reduction ⋮ On snarks that are far from being 3-edge colorable ⋮ On Perfect Matching Coverings and Even Subgraph Coverings ⋮ 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 ⋮ 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 ⋮ Measures of edge-uncolorability of cubic graphs ⋮ Double covers of cubic graphs with oddness 4 ⋮ Cycle double covers and spanning minors. I ⋮ Cycle double covers and spanning minors. II ⋮ Projective, affine, and abelian colorings of cubic graphs ⋮ Classification and characterizations of snarks ⋮ Circuit Double Covers of Graphs