Title of article
Five-Connected Toroidal Graphs Are Hamiltonian
Author/Authors
Thomas، نويسنده , , Robin and Yu، نويسنده , , Xingxing، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1997
Pages
18
From page
79
To page
96
Abstract
We prove that every edge in a 5-connected graph embedded in the torus is contained in a Hamilton cycle. Our proof is constructive and implies a polynomial time algorithm for finding a Hamilton cycle.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
1997
Journal title
Journal of Combinatorial Theory Series B
Record number
1526206
Link To Document