Faithful subgraphs and Hamiltonian circles of infinite graphs
Abstract
A circle of an infinite locally finite graph G is the imagine of a homeomorphic mapping of the unit circle S1 in |G|, the Freudenthal compactification of G. A circle of G is Hamiltonian if it meets every vertex (and then every end) of G. 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.