Five-connected toroidal graphs are Hamiltonian (Q1354120): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jctb.1996.1713 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2038476308 / rank | |||
Normal rank | |||
Revision as of 21:18, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Five-connected toroidal graphs are Hamiltonian |
scientific article |
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
