Hamilton Paths and Cycles in Vertex-Transitive Graphs of Order 6p
classification
🧮 math.CO
math.GR
keywords
graphhamiltonordervertex-transitiveconnectedcontainseverycycle
read the original abstract
It is shown that every connected vertex-transitive graph of order $6p$, where $p$ is a prime, contains a Hamilton path. Moreover, it is shown that, except for the truncation of the Petersen graph, every connected vertex-transitive graph of order $6p$ which is not genuinely imprimitive contains a Hamilton cycle.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.