10-tough chordal graphs are hamiltonian (Extended Abstract)☆
References (9)
- et al.
Not every 2-tough graph is hamiltonian
Discrete Appl. Math.
(2000) Tough graphs and hamiltonian circuits
Discrete Math.
(1973)The intersection graphs of subtrees in a tree are exactly the chordal graphs
J. Combin. Theory
(1974)Finding hamiltonian circuits in interval graphs
Inf. Proc. Lett.
(1985)
There are more references available in the full text version of this article.
Cited by (0)
- ☆
Research supported by project GA14-19503S of the Czech Science Foundation.
Copyright © 2015 Elsevier B.V. All rights reserved.