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

2007/02/07 by Kutnar, Klavdija, Sparl, Primoz · 1 citation
#05C45 #20Bxx #Combinatorics (math.CO) #FOS: Mathematics #Group Theory (math.GR)

paper · doi:10.48550/arxiv.math/0702182

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.

Cited by

• Hamilton Cycles In Vertex-Transitive Graphs of Order 10p

Related

• Hamilton cycles in vertex-transitive graphs of order 6p
• Hamilton Cycles In Vertex-Transitive Graphs of Order 10p
• On Hamilton paths in vertex-transitive graphs of order 10p
• Hamiltonicity of Vertex-Transitive Graphs of Order 4p
• Hamilton cycles in vertex-transitive graphs of order a product of two\n primes