
arXiv: 1705.07031
Investigating a problem of B. Mohar, we show that every one-ended Hamiltonian cubic graph with end degree 3 contains a second Hamilton cycle. We also construct two examples showing that this result does not extend to give a third Hamilton cycle, nor that it extends to the two-ended case.
Eulerian and Hamiltonian graphs, uniquely Hamiltonian, cubic graph, FOS: Mathematics, Mathematics - Combinatorics, 05C45, 05C07, Vertex degrees, infinite Hamilton cycle, Combinatorics (math.CO)
Eulerian and Hamiltonian graphs, uniquely Hamiltonian, cubic graph, FOS: Mathematics, Mathematics - Combinatorics, 05C45, 05C07, Vertex degrees, infinite Hamilton cycle, Combinatorics (math.CO)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 3 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
