Faithful subgraphs and Hamiltonian circles of infinite graphs
Combinatorics
2019-04-29 v2
Abstract
A circle of an infinite locally finite graph is the imagine of a homeomorphic mapping of the unit circle in , the Freudenthal compactification of . A circle of is Hamiltonian if it meets every vertex (and then every end) of . In this paper, we study a method for finding Hamiltonian circles of graphs. We illustrate this by extending several results on finite graphs to Hamiltonian circles in infinite graphs. For example, we prove that the prism of every 3-connected cubic graph has a Hamiltonian circle, extending the result of the finite case by Paulraja.
Keywords
Cite
@article{arxiv.1902.06402,
title = {Faithful subgraphs and Hamiltonian circles of infinite graphs},
author = {Binlong Li},
journal= {arXiv preprint arXiv:1902.06402},
year = {2019}
}
Comments
22 pages