The following pages link to On k-factor-critical graphs (Q2785649):
Displaying 39 items.
- Generalization of matching extensions in graphs. IV: Closures (Q343759) (← links)
- Generalization of matching extensions in graphs. III (Q534332) (← links)
- 4-factor-criticality of vertex-transitive graphs (Q726659) (← links)
- A characterization of maximal non-\(k\)-factor-critical graphs (Q861799) (← links)
- Some matching properties in \(4-\gamma_{\times 2}\)-critical graphs (Q980258) (← links)
- A conjecture on \(k\)-factor-critical and 3-\(\gamma \)-critical graphs (Q989762) (← links)
- Independence number, connectivity and \((a,b,k)\)-critical graphs (Q1043587) (← links)
- Neighborhood unions and factor critical graphs (Q1301846) (← links)
- A new degree condition for graphs to have \([a,b]\)-factor (Q1764908) (← links)
- Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs (Q1886352) (← links)
- On the \(p\)-factor-criticality of the Klein bottle (Q1886362) (← links)
- On Cartesian product of factor-critical graphs (Q1926021) (← links)
- Minimum size of \(n\)-factor-critical graphs and \(k\)-extendable graphs (Q1926044) (← links)
- The (\(n\), \(k\))-extendable graphs in surfaces (Q2000587) (← links)
- Minimum \(k\)-critical bipartite graphs (Q2043356) (← links)
- The characterization of \(p\)-factor-critical graphs (Q2115227) (← links)
- Hamiltonian cycle properties in \(k\)-extendable non-bipartite graphs with high connectivity (Q2191262) (← links)
- A characterization of \(3\)-\(\gamma\)-critical graphs which are not bicritical (Q2224855) (← links)
- A note on \(m\)-near-factor-critical graphs (Q2311372) (← links)
- Matching preclusion for cube-connected cycles (Q2352789) (← links)
- Generalization of matching extensions in graphs. II. (Q2370426) (← links)
- Degree conditions for graphs to be fractional \((a, b, n)\)-critical graphs (Q2461313) (← links)
- 3-factor-criticality in domination critical graphs (Q2462368) (← links)
- Some results on fractional \(n\)-factor-critical graphs (Q2471336) (← links)
- Toughness in graphs -- a survey (Q2494126) (← links)
- Characterizing defect \(n\)-extendable graphs and \((2n+1)\)-critical graphs (Q2519822) (← links)
- 3-factor-criticality in double domination edge critical graphs (Q2631096) (← links)
- Graph toughness from Laplacian eigenvalues (Q2700326) (← links)
- 3-Factor-Criticality of Vertex-Transitive Graphs (Q2800542) (← links)
- On the Structure of Graphs Vertex Critical with Respect to Connected Domination (Q2971614) (← links)
- NEIGHBOURHOODS OF INDEPENDENT SETS FOR (<i>a</i>,<i>b</i>,<i>k</i>)-CRITICAL GRAPHS (Q3514863) (← links)
- BIPARTITE MATCHING EXTENDABILITY AND TOUGHNESS (Q3560059) (← links)
- (Q4616117) (← links)
- (Q5708558) (← links)
- The maximum matching extendability and factor-criticality of 1-planar graphs (Q6110614) (← links)
- Minimally \(k\)-factor-critical graphs for some large \(k\) (Q6115428) (← links)
- Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical (Q6124438) (← links)
- Matching extension and distance spectral radius (Q6173921) (← links)
- Minimum degree of minimal \((n-10)\)-factor-critical graphs (Q6197704) (← links)
