Hamiltonicity of Cubic Cayley Graphs
Combinatorics
2007-05-23 v1 Group Theory
Abstract
Following a problem posed by Lov\'asz in 1969, it is believed that every connected vertex-transitive graph has a Hamilton path. This is shown here to be true for cubic Cayley graphs arising from groups having a -presentation, that is, for groups generated by an involution and an element of order such that their product has order 3. More precisely, it is shown that the Cayley graph has a Hamilton cycle when (and thus ) is congruent to 2 modulo 4, and has a long cycle missing only two vertices (and thus necessarily a Hamilton path) when is congruent to 0 modulo 4.
Cite
@article{arxiv.math/0508647,
title = {Hamiltonicity of Cubic Cayley Graphs},
author = {Henry Glover and Dragan Marusic},
journal= {arXiv preprint arXiv:math/0508647},
year = {2007}
}
Comments
13 pages, 6 figures