Extendability and criticality in matching theory

DOI10.1007/s00373-020-02139-yzbMath1439.05182OpenAlexW3006424295MaRDI QIDQ2175791

Michael D. Plummer, R. E. L. Aldred

Publication date: 30 April 2020

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

Full work available at URL: https://doi.org/10.1007/s00373-020-02139-y

zbMATH Keywords

matching extensionbicritical\(k\)-critical

Mathematics Subject Classification ID

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

Related Items (2)

The extendability of Cayley graphs generated by transpositions ⋮ Unnamed Item

Cites Work

• A polynomial algorithm for the extendability problem in bipartite graphs
• Matching extension in prism graphs
• Matching theory
• On n-extendable graphs
• The Cartesian product of a \(k\)-extendable and an \(l\)-extendable graph is \((k+l+1)\)-extendable
• Extending matchings in graphs: A survey
• The matching extension problem in general graphs is co-NP-complete
• Recent Progress in Matching Extension
• Graph Factors and Matching Extensions
• Distance restricted matching extension missing vertices and edges in 5‐connected triangulations of the plane
• Hamilton cycles in prisms
• Prism‐hamiltonicity of triangulations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Extendability and criticality in matching theory