Cycle covers of cubic multigraphs

DOI10.1016/0012-365X(93)90135-GzbMath0789.05075OpenAlexW2033936117WikidataQ127109817 ScholiaQ127109817MaRDI QIDQ686431

Brian Alspach, Cun-Quan Zhang

Publication date: 20 December 1993

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

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90135-g

zbMATH Keywords

Petersen graphcubic multigraphscycle coversplanar multigraph

Mathematics Subject Classification ID

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

Related Items (14)

Cycle covers. II: Circuit chain, Petersen chain and Hamilton weights. ⋮ Hamilton weights and Petersen minors ⋮ The construction and reduction of strong snarks ⋮ Closed 2-cell embeddings of 4 cross-cap embeddable graphs ⋮ Smallest (1, 2)‐eulerian weight and shortest cycle covering ⋮ Nowhere-zero 4-flows and cycle double covers ⋮ Circuit extension and circuit double cover of graphs ⋮ Cycle covers (I) - minimal contra pairs and Hamilton weights ⋮ Graphs with the Circuit Cover Property ⋮ Triangle-free circuit decompositions and Petersen minor ⋮ Cycle covers. III: Compatible circuit decomposition and \(K_5\)-transition minor ⋮ Circuit decompositions of Eulerian graphs ⋮ Brian Alspach and his work ⋮ Circuit Double Covers of Graphs

Cites Work

• Eulersche Linien und Kreisüberdeckungen, die vorgegebene Durchgänge in den Kanten vermeiden
• On circuit decomposition of planar Eulerian graphs
• Graphs with the Circuit Cover Property
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cycle covers of cubic multigraphs