Extending cycles locally to Hamilton cycles (Q278887)
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: Extending cycles locally to Hamilton cycles |
scientific article; zbMATH DE number 6576595
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Extending cycles locally to Hamilton cycles |
scientific article; zbMATH DE number 6576595 |
Statements
Extending cycles locally to Hamilton cycles (English)
0 references
3 May 2016
0 references
Summary: A Hamilton circle in an infinite graph is a homeomorphic copy of the~ unit circle \(S^1\) that contains all vertices and all ends precisely once. We prove that every connected, locally connected, locally finite, claw-free graph has such a Hamilton circle, extending a result of \textit{D. J. Oberly} and \textit{D. P. Sumner} [J. Graph Theory 3, 351--356 (1979; Zbl 0424.05036)] to infinite graphs. Furthermore, we show that such graphs are Hamilton-connected if and only if they are \(3\)-connected, extending a result of \textit{A. S. Asratian} [J. Graph Theory 23, No. 2, 191--201 (1996; Zbl 0858.05067)]. \textit{Hamilton-connected} means that between any two vertices there is a Hamilton arc, a homeomorphic copy of the unit interval \([0,1]\) that contains all vertices and all ends precisely once.
0 references
graph theory
0 references
Hamilton cycles
0 references
infinite graphs
0 references
0 references
0 references
0 references
0.90546227
0 references
0.8992873
0 references
0 references
0.8955758
0 references
0.89042926
0 references
0.8872505
0 references
0.88545144
0 references
0.88210475
0 references
0.8795887
0 references