论文信息 - Cayley digraphs of prime-power order are Hamiltonian - 字舞流文

Cayley digraphs of prime-power order are Hamiltonian

Abstract We find a (directed) hamiltonian circuit in any nontrivial connected Cayley digraph whose number of vertices is a prime-power.

[1] David S. Witte,et al. On Hamiltonian circuits in Cayley diagrams , 1982 .

[2] Dave Witte Morris,et al. A survey: Hamiltonian cycles in Cayley graphs , 1984, Discret. Math..

[3] W. Holsztynski,et al. Paths and circuits in finite groups , 1978, Discret. Math..

[4] A campanological problem in group theory. II , 1966 .