On the complexity of recognizing tough graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3912424 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Graph theory
- Long Cycles in Digraphs
- Long cycles in graphs with large degree sums
- Recognizing tough graphs is NP-hard
- Some Theorems on Abstract Graphs
- Tough graphs and Hamiltonian circuits.
- Toughness and the existence ofk-factors
Cited in
(20)- Recognizing brittle graphs: Remarks on a paper of Hoàng and Khouzam
- Wiener index and vulnerability parameters of graphs
- On Path-Tough Graphs
- Independence free graphs and vertex connectivity augmentation
- 1-tough cocomparability graphs are hamiltonian
- Toughness in graphs -- a survey
- scientific article; zbMATH DE number 6770058 (Why is no real title available?)
- Forbidden Induced Subgraphs for Toughness
- An efficient algorithm to compute the toughness in graphs with bounded treewidth
- The complexity of recognizing minimally tough graphs
- Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion
- Recognizing tough graphs is NP-hard
- Stability theorems for graph vulnerability parameters
- A note on the approximability of the toughness of graphs
- On the minimum degree of minimally 1-tough, triangle-free graphs and minimally 3/2-tough, claw-free graphs
- Various results on the toughness of graphs
- Toughness and vertex degrees
- Properties of minimally \(t\)-tough graphs
- ON THE HARDNESS OF RECOGNIZING BUNDLES IN TIME TABLE GRAPHS
- The complexity of recognizing tough cubic graphs
This page was built for publication: On the complexity of recognizing tough graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1313820)
