This is the first full-length book on the major theme of symmetry in graphs. Forming part of
algebraic graph theory, this fast-growing field is concerned with the study of highly …

Hamilton cycles and paths in vertex-transitive graphs—Current directions - ScienceDirect Skip
to main contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View …

A step forward is made in a long standing Lovász problem regarding existence of Hamilton
paths in vertex-transitive graphs. It is shown that a vertex-transitive graph of order a product …

Hamiltonicity of cubic Cayley graphs Page 1 J. Eur. Math. Soc. 9, 775–787 c European
Mathematical Society 2007 Henry Glover · Dragan Marušic Hamiltonicity of cubic Cayley graphs …

Given a graph X with a Hamilton cycle C, the compression factor κ (X, C) of C is the order of
the largest cyclic subgroup of Aut (C)∩ Aut (X), and the Hamilton compression κ (X) of X is …

In 1969, Lovász asked if every finite, connected vertex-transitive graph has a Hamilton path.
In spite of its easy formulation, no major breakthrough has been achieved thus far, and the …

Hamiltonicity of vertex-transitive graphs of order 4p - ScienceDirect Skip to main contentSkip
to article Elsevier logo Journals & Books Search RegisterSign in View PDF Download full …

Almost all economic activities in modern societies are scattered through space and time.
Transport processes, as a consequence, pervade everyday life and they have deep impact …

A graph is said to be vertex-transitive if its automorphism group acts transitively on the vertex
set. Some recent developments and possible future directions regarding two famous open …

It was proved by Glover and Marušič (J. Eur. Math. Soc. 9: 775–787, 2007), that cubic Cayley
graphs arising from groups G=< a, x∣ a 2= xs=(ax) 3= 1,…> having a (2, s, 3)-presentation …