| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5777661 | Journal of Combinatorial Theory, Series B | 2017 | 11 Pages |
Abstract
Chen et al. (1998) proved that every 18-tough chordal graph has a Hamilton cycle. Improving upon their bound, we show that every 10-tough chordal graph is Hamiltonian (in fact, Hamilton-connected). We use Aharoni and Haxell's hypergraph extension of Hall's Theorem as our main tool.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Adam Kabela, TomáÅ¡ Kaiser,