The following pages link to Recognizing tough graphs is NP-hard (Q918697):
Displaying 48 items.
- Best monotone degree conditions for graph properties: a survey (Q489335) (← links)
- Graph invariants and large cycles: a survey (Q539347) (← links)
- 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)
- String graphs. II: Recognizing string graphs is NP-hard (Q1112845) (← 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)
- On one extension of Dirac's theorem on Hamiltonicity (Q1630770) (← links)
- Computing the binding number of a graph (Q1813976) (← links)
- Fixed edge-length graph drawing is NP-hard (Q1813977) (← 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)
- The scattering number of strictly chordal graphs: linear time determination (Q2144221) (← links)
- Characterization of 1-tough graphs using factors (Q2185904) (← links)
- Recognition of split-graphic sequences (Q2254547) (← links)
- Toughness, binding number and restricted matching extension in a graph (Q2401801) (← links)
- A polynomial algorithm for weighted scattering number in interval graphs (Q2422741) (← links)
- Toughness and binding number (Q2448921) (← links)
- Toughness in graphs -- a survey (Q2494126) (← links)
- The complexity of recognizing minimally tough graphs (Q2656956) (← links)
- Toughness of the corona of two graphs (Q2885501) (← links)
- On the toughness index of planar graphs (Q4277991) (← links)
- The vertex attack tolerance of complex networks (Q4578160) (← links)
- Approximation and Kernelization for Chordal Vertex Deletion (Q4586151) (← links)
- Link Vulnerability in Networks (Q4640344) (← links)
- Computing the Scattering Number of Graphs (Q4780531) (← links)
- A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks (Q5087062) (← links)
- (Q5150664) (← links)
- Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs (Q5265335) (← links)
- A Note on the Link Residual Closeness of Graphs Under Join Operation (Q5384124) (← links)
- On Toughness and Hamiltonicity of 2<i>K</i><sub>2</sub>‐Free Graphs (Q5417820) (← links)
- Chvátal’s t 0-Tough Conjecture (Q5506780) (← links)
- (Q5708558) (← links)
- (Q5708565) (← links)
- A large set of non-Hamiltonian graphs (Q5954242) (← links)
- Approximation of coNP sets by NP-complete sets (Q6064009) (← links)
- Computational complexity of network vulnerability analysis (Q6160687) (← links)
- Node and link vulnerability in complete multipartite networks (Q6554732) (← links)
- An efficient algorithm to compute the toughness in graphs with bounded treewidth (Q6616440) (← links)
