A note on cyclic connectivity and matching properties of regular graphs

DOI10.1007/s00373-013-1310-3zbMath1298.05185OpenAlexW1984034523MaRDI QIDQ742609

Michael D. Plummer, Qinglin Yu, Tao Wang

Publication date: 19 September 2014

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

Full work available at URL: https://doi.org/10.1007/s00373-013-1310-3

zbMATH Keywords

matching extensionfactor-criticalbicriticalcyclic connectivity\([r -1,r\)-graph]defect-\(d\) matchingsnear bipartite

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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On several sorts of connectivity
• Recognizing near-bipartite Pfaffian graphs in polynomial time
• Restricted matching in graphs of small genus
• On n-extendable graphs
• Matchings in regular graphs
• Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs
• On matching extensions with prescribed and proscribed edge sets. II
• Two results on matching extensions with prescribed and proscribed edge sets
• Extending matchings in graphs: A survey
• Towards a characterisation of Pfaffian near bipartite graphs
• A characterisation of Pfaffian near bipartite graphs
• On independent cycles in a bipartite graph
• On restricted matching extension in planar graphs
• Generalization of matching extensions in graphs

This page was built for publication: A note on cyclic connectivity and matching properties of regular graphs