The following pages link to On n-extendable graphs (Q1143417):
Displayed 50 items.
- \(k\)-cycle resonant graphs (Q1343255) (← links)
- Two recursive theorems on \(n\)-extendibility (Q1356686) (← links)
- Matching extension and minimum degree (Q1363649) (← links)
- \((a,b,k)\)-critical graphs (Q1375824) (← links)
- \(M\)-alternating paths in \(n\)-extendable bipartite graphs (Q1402062) (← links)
- Planar \(k\)-cycle resonant graphs with \(k=1,2\) (Q1406034) (← links)
- Reducible chains of planar 1-cycle resonant graphs (Q1420593) (← links)
- Connectivity of \(k\)-extendable graphs with large \(k\). (Q1421484) (← links)
- Matching properties in domination critical graphs. (Q1426104) (← links)
- Plane elementary bipartite graphs (Q1582086) (← links)
- Matchings and matching extensions in graphs (Q1584277) (← links)
- Matching connectivity: on the structure of graphs with perfect matchings (Q1689965) (← links)
- Distance-restricted matching extendability of fullerene graphs (Q1708507) (← links)
- A new degree condition for graphs to have \([a,b]\)-factor (Q1764908) (← links)
- A note on internally disjoint alternating paths in bipartite graphs (Q1764910) (← links)
- Toughness and matching extension in graphs (Q1824634) (← links)
- Graphs with no \(M\)-alternating path between two vertices (Q1827684) (← links)
- Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs (Q1886352) (← links)
- On 2-extendable abelian Cayley graphs (Q1903715) (← links)
- The 2-extendability of strongly regular graphs (Q1910545) (← links)
- Extending matchings in planar graphs. V (Q1916120) (← links)
- High girth and extendability (Q1918540) (← links)
- Independence number in \(n\)-extendable graphs (Q1918549) (← links)
- Minimum size of \(n\)-factor-critical graphs and \(k\)-extendable graphs (Q1926044) (← links)
- Toughness and matching extension in \({\mathcal{P}_3}\)-dominated graphs (Q1959719) (← links)
- The (\(n\), \(k\))-extendable graphs in surfaces (Q2000587) (← links)
- On extendability of co-edge-regular graphs (Q2028079) (← links)
- Hamiltonian and long cycles in bipartite graphs with connectivity (Q2032971) (← links)
- Minimum \(k\)-critical bipartite graphs (Q2043356) (← links)
- Distance matching extension in cubic bipartite graphs (Q2051886) (← links)
- Spectral threshold for extremal cyclic edge-connectivity (Q2053673) (← links)
- Colouring non-even digraphs (Q2094875) (← links)
- Matching theory and Barnette's conjecture (Q2099486) (← links)
- 1-extendability of independent sets (Q2169951) (← links)
- Extendability and criticality in matching theory (Q2175791) (← links)
- Equivalence classes in matching covered graphs (Q2185935) (← links)
- Hamiltonian cycle properties in \(k\)-extendable non-bipartite graphs with high connectivity (Q2191262) (← links)
- On the extendability of certain semi-Cayley graphs of finite Abelian groups (Q2275457) (← links)
- Forbidden pairs for the matching extendability of graphs with connectivity at least 2 or 3 (Q2297715) (← links)
- On extendability of Deza graphs with diameter 2 (Q2342630) (← links)
- Bipartite double cover and perfect 2-matching covered graph with its algorithm (Q2355652) (← links)
- Generalization of matching extensions in graphs. II. (Q2370426) (← links)
- On the extendability of quasi-strongly regular graphs with diameter 2 (Q2413638) (← links)
- Game matching number of graphs (Q2446826) (← links)
- Degree conditions for graphs to be fractional \((a, b, n)\)-critical graphs (Q2461313) (← links)
- Perfect matchings after vertex deletions (Q2462373) (← links)
- On the matching extendability of graphs in surfaces (Q2464156) (← 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)