Pages that link to "Item:Q1322235"
From MaRDI portal
The following pages link to Extending matchings in graphs: A survey (Q1322235):
Displaying 16 items.
- Generalization of matching extensions in graphs. IV: Closures (Q343759) (← links)
- Matching extension in prism graphs (Q512532) (← links)
- Max-cut and extendability of matchings in distance-regular graphs (Q518196) (← links)
- Distance-restricted matching extension in planar triangulations (Q709306) (← links)
- On the restricted matching extension of graphs in surfaces (Q712598) (← links)
- A note on cyclic connectivity and matching properties of regular graphs (Q742609) (← links)
- Nice pairs of odd cycles in fullerene graphs (Q830896) (← links)
- A characterization of maximal non-\(k\)-factor-critical graphs (Q861799) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Characterizing defect \(n\)-extendable bipartite graphs with different connectivities (Q882112) (← links)
- Minimum degree of minimal defect \(n\)-extendable bipartite graphs (Q1045020) (← links)
- Minimal graphs for matching extensions (Q1686047) (← links)
- Matching connectivity: on the structure of graphs with perfect matchings (Q1689965) (← links)
- The matcher game played in graphs (Q1701097) (← links)
- The matching extension problem in general graphs is co-NP-complete (Q1743490) (← links)
- Removable and forced subgraphs of graphs (Q6495257) (← links)
