Hamilton Paths and Cycles in Vertex-Transitive Graphs of Order $6p$

Simple item page
dc.creatorKutnar, Klavdija
dc.creatorSparl, Primoz
dc.date2007-02-07
dc.date.accessioned2026-07-07T07:45:20Z
dc.date.available2026-07-07T07:45:20Z
dc.descriptionIt 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.
dc.description21 pages, 9 figures
dc.identifierhttps://arxiv.org/abs/math/0702182
dc.identifierhttp://arxiv.org/abs/math/0702182
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/123498
dc.subjectCombinatorics
dc.subjectGroup Theory
dc.subject05C45, 20Bxx
dc.titleHamilton Paths and Cycles in Vertex-Transitive Graphs of Order $6p$
dc.typetext

Files

Collections

arXiv