Abstract
After long term efforts, it was recently proved in \cite{DKM2} that except for the Peterson graph, every connected vertex-transitive graph of order has a Hamilton cycle, where and are primes. A natural topic is to solve the hamiltonian problem for connected vertex-transitive graphs of . This topic is quite trivial, as the problem is still unsolved even for that of . In this paper, it is shown that except for the Coxeter graph, every connected vertex-transitive graph of order contains a Hamilton cycle, provided the automorphism group acts primitively on vertices.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.