The following pages link to (Q4378526):
Displaying 20 items.
- Detour trees (Q277622) (← links)
- 10-tough chordal graphs are Hamiltonian (extended abstract) (Q322253) (← links)
- 10-tough chordal graphs are Hamiltonian (Q345090) (← links)
- Some properties of \(k\)-trees (Q708399) (← links)
- Toughness and Hamiltonicity in \(k\)-trees (Q868350) (← links)
- Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs (Q960979) (← links)
- On 2-walks in chordal planar graphs (Q1043570) (← links)
- Long paths and toughness of \(k\)-trees and chordal planar graphs (Q1618219) (← links)
- Not every 2-tough graph is Hamiltonian (Q1962051) (← links)
- Chordality and 2-factors in tough graphs (Q1962052) (← links)
- Toughness in graphs -- a survey (Q2494126) (← links)
- Hamiltonian cycles in 7-tough \((P_3 \cup 2P_1)\)-free graphs (Q2675828) (← links)
- More than one tough chordal planar graphs are Hamiltonian (Q4719329) (← links)
- Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs (Q5265335) (← 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)
- Forbidden subgraphs and 2‐factors in 3/2‐tough graphs (Q6074577) (← links)
- Hamiltonicity of 1-tough \((P_2 \cup KP_1)\)-free graphs (Q6184533) (← links)
- A closure lemma for tough graphs and Hamiltonian degree conditions (Q6197740) (← links)
