Hamiltonicity of Vertex-Transitive Graphs of Order 4p

2006/06/23 by Klavdija Kutnar, Kutnar, Klavdija, Dragan Marušič +1 · 3 citations
Mathematics · Engineering · Computer Science · #Finite Group Theory Research #graph theory and CDMA systems #Coding theory and cryptography

paper · doi:10.48550/arxiv.math/0606585

Abstract

It is shown that every connected vertex-transitive graph of order 4p, where p is a prime, is hamiltonian with the exception of the Coxeter graph which is known to possess a Hamilton path.

Cited by

• Twisted aughts of alternating involutions
• Hamilton Cycles In Vertex-Transitive Graphs of Order 10p
• On Hamilton cycles in connected vertex-transitive graphs of order 2pq

Related

• Hamilton Paths and Cycles in Vertex-Transitive Graphs of Order 6p
• Hamilton cycles in vertex-transitive graphs of order 6p
• Hamilton Cycles In Vertex-Transitive Graphs of Order 10p
• Hamilton Cycles In Primitive Graphs of Order 2rs
• On Hamilton paths in vertex-transitive graphs of order 10p