The following pages link to (Q4719329):
Displayed 12 items.
- 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)
- An improved degree based condition for Hamiltonian cycles (Q845978) (← 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)
- Toughness and Hamiltonicity of a class of planar graphs (Q1883251) (← links)
- Recent advances on the Hamiltonian problem: survey III (Q2441350) (← links)
- Toughness in graphs -- a survey (Q2494126) (← links)
- Chvátal’s t 0-Tough Conjecture (Q5506780) (← links)
- (Q5708558) (← links)