Circuit decompositions of Eulerian graphs

DOI10.1006/jctb.1999.1923zbMath1028.05092OpenAlexW2024226814MaRDI QIDQ1569071

Cun-Quan Zhang, Geng-Hua Fan

Publication date: 25 June 2000

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/c74d3e72487e78d078a32978da0c73cfcda9521e

zbMATH Keywords

minorconjecture of Sabidussi

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (6)

On even circuit decompositions of eulerian graphs ⋮ Compatible cycle decomposition of bad \(K_5\)-minor-free graphs ⋮ A model for finding transition-minors ⋮ On decomposing a graph into nontrivial bonds ⋮ Circle graphs and the cycle double cover conjecture ⋮ Cycle covers. III: Compatible circuit decomposition and \(K_5\)-transition minor

Cites Work

• Cycle covers of cubic multigraphs
• Eulersche Linien und Kreisüberdeckungen, die vorgegebene Durchgänge in den Kanten vermeiden
• Even circuits in planar graphs
• On circuit decomposition of planar Eulerian graphs
• On even circuit decompositions of eulerian graphs
• Graphs with the Circuit Cover Property
• On embeddings of graphs containing noK5-minor
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Circuit decompositions of Eulerian graphs