Toughness and hamiltonicity in k-trees

Broersma, H.J. and Xiong, L. and Yoshimoto, K. (2007) Toughness and hamiltonicity in k-trees. Discrete Mathematics, 307 (7-8). pp. 832-838. ISSN 0012-365X

PDF
Restricted to UT campus only: Request a copy
174Kb

Abstract:	We consider toughness conditions that guarantee the existence of a hamiltonian cycle in $k$ -trees, a subclass of the class of chordal graphs. By a result of Chen et al. 18-tough chordal graphs are hamiltonian, and by a result of Bauer et al. there exist nontraceable chordal graphs with toughness arbitrarily close to ${7\over 4}$ . It is believed that the best possible value of the toughness guaranteeing hamiltonicity of chordal graphs is less than 18, but the proof of Chen et al. indicates that proving a better result could be very complicated. We show that every 1-tough 2-tree on at least three vertices is hamiltonian, a best possible result since 1-toughness is a necessary condition for hamiltonicity. We generalize the result to $k$ -trees for $k\ge 2$ : Let $G$ be a $k$ -tree. If $G$ has toughness at least $(k+1)/3$ , then $G$ is hamiltonian. Moreover, we present infinite classes of nonhamiltonian 1-tough $k$ -trees for each $k\ge 3$ .
Item Type:	Article
Faculty:	Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:	Discrete Mathematics and Mathematical Programming (DMMP)
Link to this item:	http://purl.utwente.nl/publications/63663
Official URL:	http://dx.doi.org/10.1016/j.disc.2005.11.051
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page

Metis ID: 241601