Chvátal’s t 0-Tough Conjecture
From MaRDI portal
Publication:5506780
DOI10.1007/978-3-319-31940-7_9zbMath1362.05080MaRDI QIDQ5506780
Publication date: 16 December 2016
Published in: Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-31940-7_9
05C35: Extremal problems in graph theory
05-02: Research exposition (monographs, survey articles) pertaining to combinatorics
05C40: Connectivity
05C45: Eulerian and Hamiltonian graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Hamilton cycles in 5-connected line graphs
- On hamiltonian line graphs and connectivity
- Toughness and Hamiltonicity in \(k\)-trees
- Recognizing tough graphs is NP-hard
- Finding Hamiltonian circuits in interval graphs
- On a closure concept in claw-free graphs
- 1-tough cocomparability graphs are hamiltonian
- Toughness, hamiltonicity and split graphs
- Not every 2-tough graph is Hamiltonian
- Toughness in graphs -- a survey
- The square of every two-connected graph is Hamiltonian
- Tough graphs and Hamiltonian circuits.
- A Theorem on Planar Graphs
- Hamiltonian results inK1,3-free graphs
- Toughness and the existence ofk-factors
- Graph Classes: A Survey
- More than one tough chordal planar graphs are Hamiltonian
- Reflections on graph theory
- On Toughness and Hamiltonicity of 2K2‐Free Graphs
- Tough spiders