
An enumerably infinite graph G is hypohamiltonian, if it has no two-way infinite hamiltonian path, but every vertex deleted subgraph G-v has such a path. Thomassen gives examples of infinite hypohamiltonian graphs. Each of these graphs has a vertex of infinite degree. An infinite graph is called locally finite, if every vertex has finite degree. Thomassen raised the question, if there exist infinite hypohamiltonian graphs that are locally finite. In this paper we give an example of an infinite locally finite hypohamiltonian graph, which is planar and has vertices of degree three or four, only. Moreover, we show that there are infinitely many infinite locally finite hypohamiltonian graphs.
Eulerian and Hamiltonian graphs, 510.mathematics, infinite hypohamiltonian graphs, infinite locally finite hypohamiltonian graph, Article
Eulerian and Hamiltonian graphs, 510.mathematics, infinite hypohamiltonian graphs, infinite locally finite hypohamiltonian graph, Article
| 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). | 0 | |
| 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 |
