Cycle covers. III: Compatible circuit decomposition and K₅-transition minor

DOI10.1016/J.JCTB.2018.11.008MaRDI QIDQ2312600zbMATH OpenOpenAlexWikidataFDO

Authors Herbert Fleischner, Behrooz Bagheri Gh., Cun-Quan Zhang, Zhang Zhang

Publication date 17 July 2019

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

zbMATH Keywords

compatible circuit decompositionEulerian graphHamiltonian circuitsup-undecomposable \(K_5\)transition system

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Graph minors (05C83)

Recommendations

• Compatible cycle decomposition of bad K₅-minor-free graphs
• A model for finding transition-minors
• Circuit decompositions of Eulerian graphs
• scientific article; zbMATH DE number 871188
• Compatible circuit decompositions of 4‐regular graphs

Cites work

• A Petersen on a pentagon
• Circuit decompositions of Eulerian graphs
• Construction of permutation snarks
• Cycle covers (I) - minimal contra pairs and Hamilton weights
• Cycle covers of cubic multigraphs
• Cycle covers. II: Circuit chain, Petersen chain and Hamilton weights.
• Eulersche Linien und Kreisüberdeckungen, die vorgegebene Durchgänge in den Kanten vermeiden
• Graph theory
• Graph theory
• Graphs with the Circuit Cover Property
• Hamilton weights and Petersen minors
• Hamiltonian weights and unique 3‐edge‐colorings of cubic graphs
• scientific article; zbMATH DE number 3889568 (Why is no real title available?)
• scientific article; zbMATH DE number 3825852 (Why is no real title available?)
• scientific article; zbMATH DE number 3728302 (Why is no real title available?)
• scientific article; zbMATH DE number 3600081 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• On circuit decomposition of planar Eulerian graphs
• Polyhedral decompositions of cubic graphs

Cited in

(5)

• Compatible path-cycle-decompositions of plane graphs
• Compatible cycle decomposition of bad K₅-minor-free graphs
• A model for finding transition-minors
• Compatible circuit decompositions of 4‐regular graphs
• Perfect pseudo-matchings in cubic graphs

This page was built for publication: Cycle covers. III: Compatible circuit decomposition and \(K_5\)-transition minor

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