Cycle covers (I) - minimal contra pairs and Hamilton weights

DOI10.1016/j.jctb.2010.01.001zbMath1209.05194OpenAlexW2017277785MaRDI QIDQ974469

Cun-Quan Zhang

Publication date: 3 June 2010

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.2010.01.001

zbMATH Keywords

cycle double covercircuit chainHamilton weightfaithful cover

Mathematics Subject Classification ID

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

Related Items (4)

Cycle covers. II: Circuit chain, Petersen chain and Hamilton weights. ⋮ Strong Circuit Double Cover of Some Cubic Graphs ⋮ Generation and properties of snarks ⋮ Cycle covers. III: Compatible circuit decomposition and \(K_5\)-transition minor

Cites Work

• Cycle covers of cubic multigraphs
• Removable circuits in multigraphs
• Graphs with the Circuit Cover Property
• Hamilton weights and Petersen minors
• On the face touching number
• Hamiltonian weights and unique 3‐edge‐colorings of cubic graphs
• Compatible circuit decompositions of 4‐regular graphs
• Polyhedral decompositions of cubic graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cycle covers (I) - minimal contra pairs and Hamilton weights