Five-connected toroidal graphs are Hamiltonian (Q1354120)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Five-connected toroidal graphs are Hamiltonian |
scientific article; zbMATH DE number 1006487
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Five-connected toroidal graphs are Hamiltonian |
scientific article; zbMATH DE number 1006487 |
Statements
Five-connected toroidal graphs are Hamiltonian (English)
0 references
20 July 1997
0 references
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.
0 references
Tutte path
0 references
connectivity
0 references
representativity
0 references
torus
0 references
Hamilton cycle
0 references
polynomial time algorithm
0 references
