Recent Progress in Matching Extension
From MaRDI portal
Recommendations
Cited in
(32)- Matching connectivity: on the structure of graphs with perfect matchings
- The matching extension problem in general graphs is co-NP-complete
- The matching extendability of optimal 1-planar graphs
- Minimum size of n-factor-critical graphs and k-extendable graphs
- The (\(n\), \(k\))-extendable graphs in surfaces
- On extendability of co-edge-regular graphs
- Hamiltonian and long cycles in bipartite graphs with connectivity
- Extendability and criticality in matching theory
- Hamiltonian cycle properties in k-extendable non-bipartite graphs with high connectivity
- Toughness, binding number and restricted matching extension in a graph
- Edge proximity and matching extension in punctured planar triangulations
- Hamiltonian and long paths in bipartite graphs with connectivity
- The extendability of matchings in strongly regular graphs
- scientific article; zbMATH DE number 1123785 (Why is no real title available?)
- scientific article; zbMATH DE number 1161241 (Why is no real title available?)
- Surface embedding of \((n,k)\)-extendable graphs
- Asymmetric distance matching extension
- Matching extendability in Cartesian products of cycles
- Matching extension in prism graphs
- Max-cut and extendability of matchings in distance-regular graphs
- Surface Embedding of Non-Bipartite $k$-Extendable Graphs
- 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
- Removable and forced subgraphs of graphs
- On restricted matching extension of 1-embeddable graphs in surfaces with small genus
- The matching extendability of optimal 1-embedded graphs on the projective plane
- On the fractional matching extendability of Cayley graphs of abelian groups
- Distance-restricted matching extension in planar triangulations
- Connectivity and matching extendability of optimal 1-embedded graphs on the torus
- Matching extendability in Cartesian product of hypercubes and paths
- Extending unlocked matchings in graphs
This page was built for publication: Recent Progress in Matching Extension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3601930)