10-tough chordal graphs are hamiltonian (Extended 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.