Recent Progress in Matching Extension

DOI10.1007/978-3-540-85221-6_14zbMath1209.05189OpenAlexW97712820MaRDI QIDQ3601930

Michael D. Plummer

Publication date: 12 February 2009

Published in: Bolyai Society Mathematical Studies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85221-6_14

Mathematics Subject Classification ID

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

Related Items (23)

Toughness, binding number and restricted matching extension in a graph ⋮ Edge proximity and matching extension in punctured planar triangulations ⋮ Extendability and criticality in matching theory ⋮ Minimum size of \(n\)-factor-critical graphs and \(k\)-extendable graphs ⋮ Unnamed Item ⋮ Hamiltonian and long paths in bipartite graphs with connectivity ⋮ The extendability of matchings in strongly regular graphs ⋮ Matching connectivity: on the structure of graphs with perfect matchings ⋮ Hamiltonian cycle properties in \(k\)-extendable non-bipartite graphs with high connectivity ⋮ The maximum matching extendability and factor-criticality of 1-planar graphs ⋮ Matching extension and distance spectral radius ⋮ Matching extension and matching exclusion via the size or the spectral radius of graphs ⋮ Surface embedding of \((n,k)\)-extendable graphs ⋮ The matching extension problem in general graphs is co-NP-complete ⋮ Matching extension in prism graphs ⋮ Max-cut and extendability of matchings in distance-regular graphs ⋮ The matching extendability of optimal 1-planar graphs ⋮ The (\(n\), \(k\))-extendable graphs in surfaces ⋮ Unnamed Item ⋮ Distance-restricted matching extension in planar triangulations ⋮ On extendability of co-edge-regular graphs ⋮ Hamiltonian and long cycles in bipartite graphs with connectivity ⋮ Surface Embedding of Non-Bipartite $k$-Extendable Graphs

This page was built for publication: Recent Progress in Matching Extension