Perfect pseudo-matchings in cubic graphs

DOI10.1007/S00373-024-02844-YMaRDI QIDQ6640960zbMATH OpenFDO

Authors Herbert Fleischner, Behrooz Bagheri Gh, Benedikt Klocker

Publication date 20 November 2024

Published in Graphs and Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

Eulerian graphsnarkcycle double covertransition systemcompatible cycle decompositionperfect pseudo-matching

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Shortest perfect pseudomatchings in fullerene graphs
• Cubic graphs that cannot be covered with four perfect matchings
• scientific article; zbMATH DE number 3957168
• Perfect matchings in planar cubic graphs

Cites work

• scientific article; zbMATH DE number 3885954 (Why is no real title available?)
• scientific article; zbMATH DE number 4106897 (Why is no real title available?)
• scientific article; zbMATH DE number 4108816 (Why is no real title available?)
• scientific article; zbMATH DE number 568843 (Why is no real title available?)
• scientific article; zbMATH DE number 3249675 (Why is no real title available?)
• scientific article; zbMATH DE number 3060538 (Why is no real title available?)
• A model for finding transition-minors
• A note on 5-cycle double covers
• Circuit decompositions of Eulerian graphs
• Circular chromatic index of generalized Blanuša snarks
• Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks
• Cycle covers. III: Compatible circuit decomposition and \(K_5\)-transition minor
• Eulerian graphs and related topics. Part 1, Volume 1
• Eulersche Linien und Kreisüberdeckungen, die vorgegebene Durchgänge in den Kanten vermeiden
• Graph theory
• On a closure concept in claw-free graphs
• Uniquely Hamiltonian graphs of minimum degree 4

This page was built for publication: Perfect pseudo-matchings in cubic graphs

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