Extendability and criticality in matching theory

DOI10.1007/S00373-020-02139-YMaRDI QIDQ2175791zbMATH OpenOpenAlexFDO

Authors 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

\(k\)-criticalbicriticalmatching extension

Mathematics Subject Classification ID

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

Recommendations

• An extension of matching theory
• BIPARTITE MATCHING EXTENDABILITY AND TOUGHNESS
• The extendability of matchings in strongly regular graphs
• Towards a problem of Ruskey and Savage on matching extendability
• scientific article; zbMATH DE number 5850547
• Generalization of matching extensions in graphs
• scientific article; zbMATH DE number 863471
• Matching, matroids, and extensions
• Matchings and matching extensions in graphs
• Extending matchings in graphs: A survey

Cites work

• A polynomial algorithm for the extendability problem in bipartite graphs
• Distance restricted matching extension missing vertices and edges in 5-connected triangulations of the plane
• Extending matchings in graphs: A survey
• Extending matchings in odd graphs
• Extending matchings in planar odd graphs.
• Graph Factors and Matching Extensions
• Graph theory with applications
• Hamilton cycles in prisms
• scientific article; zbMATH DE number 434908 (Why is no real title available?)
• scientific article; zbMATH DE number 1161241 (Why is no real title available?)
• scientific article; zbMATH DE number 1550912 (Why is no real title available?)
• scientific article; zbMATH DE number 4118405 (Why is no real title available?)
• scientific article; zbMATH DE number 2104730 (Why is no real title available?)
• scientific article; zbMATH DE number 874216 (Why is no real title available?)
• Matching extension in prism graphs
• Matching theory
• On n-extendable graphs
• Prism‐hamiltonicity of triangulations
• Recent Progress in Matching Extension
• The Cartesian product of a \(k\)-extendable and an \(l\)-extendable graph is \((k+l+1)\)-extendable
• The matching extension problem in general graphs is co-NP-complete
• Topics in graph theory. Graphs and their Cartesian product

Cited in

(13)

• Extending matchings in graphs: A survey
• Extendability and factor-criticality
• Construction for bicritical graphs and \(k\)-extendable bipartite graphs
• scientific article; zbMATH DE number 434908 (Why is no real title available?)
• BIPARTITE MATCHING EXTENDABILITY AND TOUGHNESS
• scientific article; zbMATH DE number 19207 (Why is no real title available?)
• scientific article; zbMATH DE number 1123785 (Why is no real title available?)
• scientific article; zbMATH DE number 874216 (Why is no real title available?)
• Matching extendability in Cartesian products of cycles
• The extendability of Cayley graphs generated by transpositions
• On defect restricted matching extension graphs
• Matching extendability in Cartesian product of hypercubes and paths
• Extending unlocked matchings in graphs

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

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