The following pages link to Recognizing tough graphs is NP-hard (Q918697):
Displayed 22 items.
- Toughness and Delaunay triangulations (Q803161) (← links)
- An upper bound on the shortness exponent of 1-tough, maximal planar graphs (Q805630) (← links)
- Bipartite toughness and \(k\)-factors in bipartite graphs (Q1008540) (← links)
- On the complexity of recognizing tough graphs (Q1313820) (← links)
- Maximum and minimum toughness of graphs of small genus (Q1356471) (← links)
- 1-tough cocomparability graphs are hamiltonian (Q1363656) (← links)
- Measuring the vulnerability for classes of intersection graphs (Q1364473) (← links)
- The complexity of recognizing tough cubic graphs (Q1372728) (← links)
- Better approximations of non-Hamiltonian graphs (Q1382268) (← links)
- The toughness of split graphs (Q1584388) (← links)
- Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness (Q1602687) (← links)
- Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion (Q1613360) (← links)
- Computing the binding number of a graph (Q1813976) (← links)
- A note on the approximability of the toughness of graphs (Q1827680) (← links)
- Toughness, hamiltonicity and split graphs (Q1916113) (← links)
- A note on dominating cycles in 2-connected graphs (Q1923475) (← links)
- Toughness in graphs -- a survey (Q2494126) (← links)
- On the toughness index of planar graphs (Q4277991) (← links)
- Computing the Scattering Number of Graphs (Q4780531) (← links)
- (Q5708558) (← links)
- (Q5708565) (← links)
- A large set of non-Hamiltonian graphs (Q5954242) (← links)