2000 character limit reached
Hamilton cycles in infinite cubic graphs (1705.07031v1)
Published 19 May 2017 in math.CO
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.
