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

DOI10.1016/J.JCTB.2010.01.001zbMATH Open1209.05194OpenAlexW2017277785MaRDI QIDQ974469FDOQ974469

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

circuit chainHamilton weightcycle double coverfaithful cover

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Hamiltonian weights and unique 3‐edge‐colorings of cubic graphs
• Polyhedral decompositions of cubic graphs
• Removable circuits in multigraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graphs with the Circuit Cover Property
• Hamilton weights and Petersen minors
• Compatible circuit decompositions of 4‐regular graphs
• Cycle covers of cubic multigraphs
• Title not available (Why is that?)
• On the face touching number

Cited In (5)

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

   Recommendations

• Hamilton weights and Petersen minors 👍 👎
• Cycle covers. II: Circuit chain, Petersen chain and Hamilton weights. 👍 👎
• Graphs with the Circuit Cover Property 👍 👎
• Hamiltonian weights and unique 3‐edge‐colorings of cubic graphs 👍 👎
• Title not available (Why is that?) 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q974469)