Pages that link to "Item:Q1313820"
From MaRDI portal
The following pages link to On the complexity of recognizing tough graphs (Q1313820):
Displayed 10 items.
- 1-tough cocomparability graphs are hamiltonian (Q1363656) (← links)
- The complexity of recognizing tough cubic graphs (Q1372728) (← links)
- Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion (Q1613360) (← links)
- Independence free graphs and vertex connectivity augmentation (Q1775893) (← links)
- Properties of minimally \(t\)-tough graphs (Q2411622) (← links)
- Toughness in graphs -- a survey (Q2494126) (← links)
- Stability theorems for graph vulnerability parameters (Q2657079) (← links)
- Various results on the toughness of graphs (Q4254359) (← links)
- Forbidden Induced Subgraphs for Toughness (Q4920659) (← links)
- Wiener index and vulnerability parameters of graphs (Q6166041) (← links)