Hamiltonian cycles and paths in Cayley graphs and digraphs - A survey

Abstract Cayley graphs arise naturally in computer science, in the study of word-hyperbolic groups and automatic groups, in change-ringing, in creating Escher-like repeating patterns in the hyperbolic plane, and in combinatorial designs. Moreover, Babai has shown that all graphs can be realized as an induced subgraph of a Cayley graph of any sufficiently large group. Since the 1984 survey of results on hamiltonian cycles and paths in Cayley graphs by Witte and Gallian, many advances have been made. In this paper we chronicle these results and include some open problems and conjectures.

[1]  Frank Ruskey,et al.  Determining the hamilton-connectedness of certain vertex-transitive graphs , 1994, Discret. Math..

[2]  C. C. Chen,et al.  Hamiltonian cayley graphs of order PQ , 1983 .

[3]  S. Lakshmivarahan,et al.  A new class of interconnection networks based on the alternating group , 1993, Networks.

[4]  Jiuqiang Liu,et al.  Pseudo-cartesian product and hamiltonian decompositions of Cayley graphs on abelian groups , 1996, Discret. Math..

[5]  Stephen J. Curran.  Hamilton paths in Cayley diagraphs of metacyclic groups , 1993, Discret. Math..

[6]  A. Nijenhuis.  Combinatorial algorithms , 1975 .

[7]  P. Diaconis,et al.  Gray codes for randomization procedures , 1994 .

[8]  Ronald J. Gould,et al.  Cayley digraphs and (1, j, n)-sequencings of the alternating groups An , 1987, Discret. Math..

[9]  Jiuqiang Liu.  Hamiltonian decompositions of Cayley graphs on Abelian groups , 1994, Discret. Math..

[10]  Paul Erdös,et al.  When the cartesian product of directed cycles is Hamiltonian , 1978, J. Graph Theory.

[11]  Carla D. Savage,et al.  Hamilto-connected derangement graphs on S n , 1994, Discret. Math..

[12]  C. C. Chen,et al.  On strongly hamiltonian abelian group graphs , 1981 .

[13]  Brian Alspach,et al.  Lifting Hamilton cycles of quotient graphs , 1989, Discret. Math..

[14]  S. Lakshmivarahan,et al.  Symmetry in Interconnection Networks Based on Cayley Graphs of Permutation Groups: A Survey , 1993, Parallel Comput..

[15]  David B. A. Epstein,et al.  Word processing in groups , 1992 .

[16]  Dave Witte Morris,et al.  When the cartesian product of two directed cycles is hypo-Hamiltonian , 1983, J. Graph Theory.

[17]  Jean-Claude Bermond,et al.  Hamiltonian decomposition of Cayley graphs of degree 4 , 1989, J. Comb. Theory, Ser. B.

[18]  Kevin Keating,et al.  On Hamilton Cycles in Cayley Ghaphs in Groups with Cyclic Commutator Subgroup , 1985 .

[19]  Henry H. Glover,et al.  A Hamilton cycle in the Cayley graph of the <2, p, 3> presentation of PSL2(p) , 1996, Discret. Math..

[20]  Erich Durnberger.  Connected Cayley graphs of semi-direct products of cyclic groups of prime order by abelian groups are hamiltonian , 1983, Discret. Math..

[21]  Herbert S. Wilf,et al.  Combinatorial Algorithms: An Update , 1987 .

[22]  Brian Alspach,et al.  VERTEX‐TRANSITIVE GRAPHS OF ORDER 2p , 1979 .

[23]  R. Rankin.  A campanological problem in group theory. II , 1966, Mathematical Proceedings of the Cambridge Philosophical Society.

[24]  Douglas Jungreis.  Hamiltonian paths in Cayley digraphs of finitely-generated infinite abelian groups , 1989, Discret. Math..

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

[26]  Stephen J. Curran,et al.  Hamilton Paths in Cartesian Products of Directed Cycles , 1985 .

[27]  Douglas R Stinson,et al.  Contemporary design theory : a collection of surveys , 1992 .

[28]  Erich Durnberger,et al.  Every Connected Cayley Graph of a Group with Prime Order Commutator Group has a Hamilton Cycle , 1985 .

[29]  Douglas S. Jungreis.  Generalized hamiltonian circuits in the cartesian product of two-directed cycles , 1988, J. Graph Theory.

[30]  N. J. A. Sloane,et al.  Gray codes for reflection groups , 1989, Graphs Comb..

[31]  Arthur T. White,et al.  Ringing the Cosets , 1987 .

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

[33]  Yixiu Huang.  On Hamiltonian Decompositions of Cayley Graphs on Cyclic Groups , 1989 .

[34]  Dave Witte Morris,et al.  Cayley digraphs of prime-power order are hamiltonian , 1986, J. Comb. Theory, Ser. B.

[35]  Jean-Claude Bermond,et al.  Decomposition into Cycles I: Hamilton Decompositions , 1990 .

[36]  Khaled Day,et al.  Arrangement Graphs: A Class of Generalized Star Graphs , 1992, Inf. Process. Lett..

[37]  Robert E. Woodrow,et al.  Cycles and rays , 1990 .

[38]  T. C. Hu,et al.  Combinatorial algorithms , 1982 .

[39]  Stephen J. Curran.  Disjoint circuits in the cartesian product of two directed cycles , 1994, J. Graph Theory.

[40]  Ming-Yao Xu,et al.  Vertex-primitive digraphs of prime-power order are hamiltonian , 1994, Discret. Math..

[41]  Dragan Marui.  Hamiltonian circuits in Cayley graphs , 1983 .

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

[43]  Richard Stong.  Hamilton decompositions of cartesian products of graphs , 1991, Discret. Math..

[44]  Dave Witte Morris,et al.  Infinite Hamiltonian paths in Cayley diagraphs of hyperbolic symmetry groups , 1995, Discret. Math..

[45]  Dave Witte Morris.  On Hamiltonian circuits in Cayley diagrams , 1982, Discret. Math..

[46]  Stephen A. Wong.  Hamilton cycles and paths in butterfly graphs , 1995, Networks.

[47]  Frank Ruskey,et al.  Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of Sn , 1993, SIAM J. Discret. Math..

[48]  André Raspaud,et al.  Two Edge-Disjoint Hamiltonian Cycles in the Butterfly Graph , 1994, Inf. Process. Lett..

[49]  H. Coxeter,et al.  Generators and relations for discrete groups , 1957 .

[50]  Arnold L. Rosenberg,et al.  Group Action Graphs and Parallel Architectures , 1990, SIAM J. Comput..

[51]  Marsha F. Foregger.  Hamiltonian decompositions of products of cycles , 1978, Discret. Math..

[52]  Kevin Keating.  Multiple-Ply Hamiltonian Graphs and Digraphs , 1985 .

[53]  C. C. Chen.  On edge-Hamiltonian property of Cayley graphs , 1988, Discret. Math..

[54]  Gail Letzter.  Hamilton Circuits in Cartesian Products with a Metacyclic Factor , 1985 .

[55]  Joseph A. Gallian,et al.  Contemporary Abstract Algebra , 2021 .

[56]  Chris D. Godsil,et al.  Embedding graphs in Cayley graphs , 1987, Graphs Comb..

[57]  David Housman,et al.  Enumeration of hamiltonian paths in Cayley diagrams , 1981 .

[58]  Dave Witte Morris,et al.  Creating repeating hyperbolic patterns , 1981, SIGGRAPH '81.

[59]  Anne Marie Wilkinson.  Circuits in cayley digraphs of finite abelian groups , 1990, J. Graph Theory.

[60]  S. Gill Williamson,et al.  Doubly adjacent gray codes for the symmetric group , 1993 .

[61]  Shirley Dex,et al.  JR 旅客販売総合システム（マルス）における運用及び管理について , 1991 .

[62]  Irwin L Jungreis.  Infinite Hamiltonian paths in Cayley digraphs , 1985, Discret. Math..

[63]  X Zhang.  HAMILTONIAN CIRCUITS OF CAYLEY DIGRAPH ON A CYCLIC GROUP , 1990 .

[64]  Frank Ruskey,et al.  The Hamiltonicity of Directed sigma - tao Cayley Graphs (or: A Tale of Backtracking) , 1995, Discret. Appl. Math..

[65]  V. L. Kompel'makher,et al.  Sequential generation of arrangements by means of a basis of transpositions , 1975 .

[66]  Joseph B. Klerlein.  Hamiltonian cycles in cayley color graphs , 1978, J. Graph Theory.

[67]  Dave Witte Morris,et al.  When the cartesian product of two directed cycles is hyperhamiltonian , 1987, J. Graph Theory.

[68]  Richard Stong.  On Hamiltonian cycles in Cayley graphs of wreath products , 1987, Discret. Math..

[69]  David L. Powers,et al.  Some Hamiltonian Cayley Graphs , 1985 .