The following pages link to (Q4393233):
Displaying 32 items.
- Matching extension in prism graphs (Q512532) (← links)
- Extending matchings in planar graphs. IV (Q686303) (← links)
- Distance-restricted matching extension in planar triangulations (Q709306) (← links)
- Graphs with no \(M\)-alternating paths between two vertices: an update (Q712278) (← 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)
- 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)
- \(M\)-alternating paths in \(n\)-extendable bipartite graphs (Q1402062) (← links)
- Connectivity of \(k\)-extendable graphs with large \(k\). (Q1421484) (← links)
- The matching extension problem in general graphs is co-NP-complete (Q1743490) (← links)
- Graphs with no \(M\)-alternating path between two vertices (Q1827684) (← links)
- Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs (Q1886352) (← links)
- On the \(p\)-factor-criticality of the Klein bottle (Q1886362) (← links)
- Minimum size of \(n\)-factor-critical graphs and \(k\)-extendable graphs (Q1926044) (← links)
- The (\(n\), \(k\))-extendable graphs in surfaces (Q2000587) (← links)
- Extendability and criticality in matching theory (Q2175791) (← links)
- Toughness, binding number and restricted matching extension in a graph (Q2401801) (← links)
- Edge proximity and matching extension in punctured planar triangulations (Q2404389) (← links)
- Characterizing minimally \(n\)-extendable bipartite graphs (Q2483409) (← links)
- Construction for bicritical graphs and \(k\)-extendable bipartite graphs (Q2497479) (← links)
- Edge Proximity Conditions for Extendability in Planar Triangulations (Q2947852) (← links)
- (Q4990102) (← links)
- (Q5080925) (← links)
- Generalization of matching extensions in graphs (Q5937599) (← links)
- The maximum matching extendability and factor-criticality of 1-planar graphs (Q6110614) (← links)
- Matching extension and distance spectral radius (Q6173921) (← links)
- Removable and forced subgraphs of graphs (Q6495257) (← links)
- On restricted matching extension of 1-embeddable graphs in surfaces with small genus (Q6589143) (← links)
