Speaker
Prof.
Elena Konstantinova
(Sobolev Institute of Mathematics, Novosibirsk, Russia)
Description
In this talk we consider the hamiltonian problem for Cayley graphs having hierarchical structure (such as the hypercubes, the Pancake graphs, the Star graphs). Approaches and algorithms for getting hamiltonian cycles and paths are given. The connections to Gray codes are illustrated. Open problems are also discussed.
Primary author
Prof.
Elena Konstantinova
(Sobolev Institute of Mathematics, Novosibirsk, Russia)
