Pages that link to "Item:Q1322235"
From MaRDI portal
The following pages link to Extending matchings in graphs: A survey (Q1322235):
Displayed 21 items.
- Distance-restricted matching extension in planar triangulations (Q709306) (← 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)
- On matching extensions with prescribed and proscribed edge sets. II (Q1292810) (← links)
- A local independence number condition for \(n\)-extendable graphs (Q1296992) (← links)
- Matching extension in \(K_{1,r}\)-free graphs with independent claw centers (Q1356714) (← links)
- Matching extension and minimum degree (Q1363649) (← links)
- \(M\)-alternating paths in \(n\)-extendable bipartite graphs (Q1402062) (← links)
- Plane elementary bipartite graphs (Q1582086) (← links)
- Matchings and matching extensions in graphs (Q1584277) (← links)
- Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs (Q1886352) (← links)
- On the \(p\)-factor-criticality of the Klein bottle (Q1886362) (← links)
- Independence number in \(n\)-extendable graphs (Q1918549) (← links)
- Characterizing minimally \(n\)-extendable bipartite graphs (Q2483409) (← links)
- Counting perfect matchings in \(n\)-extendable graphs (Q2483418) (← links)
- Construction for bicritical graphs and \(k\)-extendable bipartite graphs (Q2497479) (← links)
- Brace generation (Q2781060) (← links)
- Subgraphs of Random<i>k</i>-Edge-Coloured<i>k</i>-Regular Graphs (Q3552512) (← links)
- Algorithms for (0, 1,<i>d</i>)-graphs with<i>d</i>constrains (Q5747711) (← links)