Perfect pseudo-matchings in cubic graphs

DOI10.1007/S00373-024-02844-YMaRDI QIDQ6640960FDOQ6640960

Authors: Herbert Fleischner, Behrooz Bagheri Gh, Benedikt Klocker 

Publication date: 20 November 2024

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

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

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)

Cites Work

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

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)