Hamilton cycles in infinite cubic graphs
Combinatorics
2017-05-22 v1
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.
Cite
@article{arxiv.1705.07031,
title = {Hamilton cycles in infinite cubic graphs},
author = {Max Pitz},
journal= {arXiv preprint arXiv:1705.07031},
year = {2017}
}
Comments
9 pages, 8 Figures