| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9516098 | Journal of Combinatorial Theory, Series B | 2005 | 23 Pages |
Abstract
Tutte has shown that every 4-connected planar graph contains a Hamilton cycle. Grünbaum and Nash-Williams independently conjectured that the same is true for toroidal graphs. In this paper, we prove that every 4-connected toroidal graph contains a Hamilton path.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Robin Thomas, Xingxing Yu, Wenan Zang,