10-tough chordal graphs are hamiltonian (Extended Abstract)

https://doi.org/10.1016/j.endm.2015.06.045Get rights and content

Abstract

Chen et al. proved that every 18-tough chordal graph has a hamiltonian cycle. Improving upon their bound, we show that every 10-tough chordal graph is hamiltonian. We use Aharoni and Haxell's hypergraph extension of Hall's Theorem as our main tool.

References (9)

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.

View full text