Hamiltonicity of vertex-transitive graphs of order 4p

Authors:
Klavdija Kutnar;Dragan Marušič
Affiliations:
University of Primorska, Titov trg 4, 6000 Koper, Slovenia;University of Primorska, Titov trg 4, 6000 Koper, Slovenia and University of Ljubljana, IMFM, Jadranska 19, 1000 Ljubljana, Slovenia
Venue:
European Journal of Combinatorics
Year:
2008

Citing 10
Cited 3

Cayley digraphs of prime-power order are Hamiltonian

Journal of Combinatorial Theory Series B
Hamiltonian cycles in vertex symmetric graphs of order 2p2

Discrete Mathematics
Lifting Hamilton cycles of quotient graphs

Discrete Mathematics - In memory of Tory Parsons
The Hamilton spaces of Cayley graphs on abelian groups

Discrete Mathematics
Hamiltonian cycles and paths in Cayley graphs and digraphs—a survey

Discrete Mathematics
A Hamilton cycle in the Cayley graph of the p,3 presentation of PSL2(p)

Discrete Mathematics
The MAGMA algebra system I: the user language

Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
On Hamiltonicity of vertex-transitive graphs and digraphs of order p4

Journal of Combinatorial Theory Series B
Automorphism groups with cyclic commutator subgroup and Hamilton cycles

Discrete Mathematics
Hamilton-connected Cayley graphs on Hamiltonian groups

European Journal of Combinatorics

Hamiltonian cycles in cubic Cayley graphs: the {2,4k,3} case

Journal of Algebraic Combinatorics: An International Journal
Hamilton paths in vertex-transitive graphs of order 10p

European Journal of Combinatorics
Hamilton cycle and Hamilton path extendability of Cayley graphs on abelian groups

Journal of Graph Theory

Quantified Score

Hi-index	0.00

Visualization

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.