Perfect matchings in highly cyclically connected regular graphs

DOI10.1002/jgt.22764zbMath1522.05383arXiv1709.08891OpenAlexW3208310298MaRDI QIDQ6057581

Robert Lukot'ka, Edita Rollová

Publication date: 5 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1709.08891

zbMATH Keywords

2-factorregular graphperfect matchingcyclic connectivity

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matching preclusion and conditional matching preclusion for regular interconnection networks
• \(k\) -factors in regular graphs
• Conditional matching preclusion sets
• Signed graphs
• On the 2-extendability of planar graphs
• Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs
• A note on 1-factors in certain regular multigraphs
• A note on 1-factors in graphs
• Reduction of the 5-flow conjecture to cyclically 6-edge-connected snarks.
• Regular factors in regular graphs
• Dynamic cage survey
• Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions
• Edge proximity conditions for extendability in cubic bipartite graphs
• 2‐factors with prescribed and proscribed edges

This page was built for publication: Perfect matchings in highly cyclically connected regular graphs