Pages that link to "Item:Q3731636"
From MaRDI portal
The following pages link to Toughness and the existence ofk-factors (Q3731636):
Displaying 50 items.
- How many conjectures can you stand? A survey (Q659764) (← links)
- The existence of \(k\)-factors in squares of graphs (Q712263) (← links)
- Toughness and \([a, b]\)-factors with inclusion\(/\)exclusion properties (Q763635) (← links)
- Toughness and prism-Hamiltonicity of \(P_4\)-free graphs (Q777381) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Recognizing tough graphs is NP-hard (Q918697) (← links)
- Bipartite toughness and \(k\)-factors in bipartite graphs (Q1008540) (← links)
- Toughness and the existence of k-factors. II (Q1106860) (← links)
- On the complexity of recognizing tough graphs (Q1313820) (← links)
- Extending matchings in graphs: A survey (Q1322235) (← links)
- Toughness of graphs and \([2,b]\)-factors (Q1334935) (← links)
- Toughness and edge-toughness (Q1356703) (← links)
- Path partition number in tough graphs (Q1356718) (← links)
- On a closure concept in claw-free graphs (Q1362093) (← links)
- 1-tough cocomparability graphs are hamiltonian (Q1363656) (← links)
- The complexity of recognizing tough cubic graphs (Q1372728) (← links)
- Better approximations of non-Hamiltonian graphs (Q1382268) (← links)
- Toughness and the existence of \(k\)-factors. IV (Q1567269) (← links)
- Toughness and the existence of \(k\)-factors. III (Q1584359) (← links)
- 2-factors and Hamiltonicity (Q1584422) (← links)
- Toughness of graphs and the existence of factors (Q1813740) (← links)
- Toughness and matching extension in graphs (Q1824634) (← links)
- Toughness and Hamiltonicity of a class of planar graphs (Q1883251) (← links)
- Hamiltonian degree conditions for tough graphs (Q1896350) (← links)
- Minimum degree, independence number and regular factors (Q1906860) (← links)
- Toughness, hamiltonicity and split graphs (Q1916113) (← links)
- Degree sequences and the existence of \(k\)-factors (Q1926057) (← links)
- Toughness and \((a,b,k)\)-critical graphs (Q1944908) (← links)
- Not every 2-tough graph is Hamiltonian (Q1962051) (← links)
- Chordality and 2-factors in tough graphs (Q1962052) (← links)
- Pseudo-Hamiltonian-connected graphs (Q1971217) (← links)
- Connected even factors in \(k\)-tree (Q2053544) (← links)
- Connected \(k\)-factors in bipartite graphs (Q2092400) (← links)
- Some results on path-factor critical avoidable graphs (Q2107757) (← links)
- Spanning trees and spanning closed walks with small degrees (Q2144593) (← links)
- Characterization of 1-tough graphs using factors (Q2185904) (← links)
- Strong Tutte type conditions and factors of graphs (Q2194531) (← links)
- Research on fractional critical covered graphs (Q2211178) (← links)
- Long paths and cycles in tough graphs (Q2366213) (← links)
- Local topological toughness and local factors (Q2385135) (← links)
- Vizing's 2-factor conjecture involving toughness and maximum degree conditions (Q2415079) (← links)
- Maximum fractional factors in graphs (Q2472791) (← links)
- Toughness and the existence of fractional \(k\)-factors of graphs (Q2477400) (← links)
- Toughness in graphs -- a survey (Q2494126) (← links)
- A note on interconnecting matchings in graphs (Q2509302) (← links)
- Toughness for fractional \((2, b, k)\)-critical covered graphs (Q2687688) (← links)
- Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey (Q2695475) (← links)
- Graph toughness from Laplacian eigenvalues (Q2700326) (← links)
- Toughness, Hamiltonicity and spectral radius in graphs (Q2701002) (← links)
- Toughness and perfect matchings in graphs (Q2715945) (← links)
