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

Discrete Mathematics

Volumn 156, Issue 1-3, 1996, Pages 1-18

  Curran, Stephen J ^a   Gallian, Joseph A ^b  

^a UNIVERSITY OF PITTSBURGH   (United States)

^b UNIVERSITY OF MINNESOTA DULUTH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038621119     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(95)00072-5     Document Type: Article

References (89)

1. B. Alspach, Hamiltonian cycles in vertex-transitive graphs of order 2p, Congr. Numer. 23 (1979) 131-139.
2. B. Alspach, Hamiltonian partitions of vertex-transitive graphs of order 2p, Congr. Numer. 28 (1980) 217-221.
3. B. Alspach, Research problem 59, Discrete Math. 50 (1984) 115.
4. B. Alspach, Unsolved problem 4.5, Ann. Discrete Math. 27 (1985) 464.
5. B. Alspach, Lifting Hamilton cycles of quotient graphs, Discrete Math. 78 (1989) 25-36.
6. B. Alspach, J.-C. Bermond and D. Sotteau, Decompositions into cycles I: Hamilton decompositions, in: G. Hahn, ed., Cycles and Rays (Kluwer Academic Publishers, Netherlands, 1990) 9-18.
7. B. Alspach and C.D. Godsil, eds., Cycles in Graphs, Ann. Discrete Math. Vol. 27 (North-Holland, Amsterdam, 1985).
8. B. Alspach, K. Heinrich and G. Liu, Orthogonal factorizations of graphs, in: J. Dinitz and D.R. Stinson, eds, in: Contemporary Design Theory: A collection of Surveys (Wiley, New York, 1992) 13-40).
9. B. Alspach and C.Q. Zhang, Hamilton cycles in cubic Cayley graphs on dihedral groups, Ars Combin. 28 (1989) 101-108.
10. F. Annexstein, M. Baumslag and A.L. Rosenberg, Group action graphs and parallel architecture, SIAM J. Comput. 19 (1990) 544-569.
11. L. Babai, Embedding graphs in Cayley graphs, in: Problèmes Combinatoires et Théorie des Graphes, Colloques Internationaux CNRS, No. 260, 13-15.
12. D. Barth and A. Raspaud, Two disjoint hamiltonian cycles in the butterfly graph, Inform. Process. Lett. 51 (1994) 175-179.
13. J.-C. Bermond, Hamilton decomposition of graphs, directed graphs and hypergraphs, in: Advances of Graph Theory, Ann. Discrete Math. 3 (1978) 21-28.
14. J.-C. Bermond, O. Favaron and M. Maheo, Hamiltonian decomposition of Cayley graphs of degree 4, J. Combin Theory Ser. B 46 (1989) 142-153.
15. C.C. Chen, On edge-hamiltonian property of Cayley graphs, Discrete Math. 72 (1988) 29-33.
16. C.C. Chen and N.F. Quimpo, On some classes of hamiltonian groups, Southeast Asian Bull. Math. Special issue (1979) 252-258.
17. C.C. Chen and N.F. Quimpo, On strongly hamiltonian abelian group graphs, in: K.L. McAvaney, ed., Combinatorial Mathematics VIII, Lecture Notes in Mathematics, Vol. 884 (Springer, Berlin, 1981) 23-34.
18. C.C. Chen and N.F. Quimpo, Hamiltonian Cayley graphs of order pq, Combinatorial Math. X, Springer-Verlag Lecture Note Series No. 1036 (Springer, Berlin, 1983) 1-5.
19. R.C. Compton and S.G. Williamson, Doubly adjacent gray codes for the symmetric group, TR-CS91-220, U.C. San Diego, 1991.
20. J.H. Conway, N.J.A. Sloane and A.R. Wilks, Gray codes for reflection groups, Graphs Combin. 5 (1989) 315-325.
21. H. Coxeter and W. Moser, Generators and Relations for Discrete Groups (Springer, New York, 4th ed., 1980).
22. S.J. Curran, A generalization of a theorem of Rankin, Congr. Numer. 83 (1991) 167-175.
23. S.J. Curran, Hamilton paths in Cayley digraphs on the semidirect product of cyclic groups, Congr. Numer. 89 (1992) 209-221.
24. S.J. Curran, Hamilton paths in Cayley digraphs of metacyclic groups, Discrete Math. 115 (1993) 133-139.
25. S.J. Curran, Disjoint circuits in the cartesian product of directed cycles, J. Graph Theory 18 (1994) 211-216.
26. S.J. Curran, Enumeration of hamilton paths in Cayley digraphs on semidirect products of cyclic groups, in: Y. Alavi and A. Schwenk, eds, Graph Theory, Combinatorics, and Applications: Proceedings of the Seventh Quadrennial International Conference on the Theory and Applications of Graphs, vol. 1 (Wiley, New York, 1995) 251-263.
27. S.J. Curran, Hamilton circuits in Cayley digraphs on abelian groups and dihedral groups, Preprint.
28. * S.J. Curran and D. Witte, Hamilton paths in cartesian products of directed cycles, Ann. Discrete Math. 27 (1985) 35-74.
29. K. Day and A. Tripathi, Arrangement graphs: A class of generalized star graphs, Inform. Process. Lett. 42 (1992) 235-241.
30. P. Diaconis and S. Holmes, Grey codes for randomization procedures, Technical Report No. 10, Dept. Statistics, Stanford Univ., 1994.
31. D. Dunham, D.S. Jungreis and D. Witte, Infinite hamiltonian paths in Cayley digraphs of hyperbolic symmetry groups, Discrete Math. 143 (1995) 1-30.
32. D. Dunham, J. Lindgren and D. Witte, Creating repeating hyperbolic patterns, Computer Graphics 15 (1981) 215-223.
33. E. Durnberger, Connected Cayley graphs of semi-direct products of cyclic groups of prime order by Abelian groups are Hamiltonian, Discrete Math. 46 (1983) 55-68.
34. * E. Durnberger, Every connected Cayley graph of a group with prime order commutator group has a hamilton cycle, Ann. Discrete Math. 27 (1985) 75-80.
35. D.B.A. Epstein, J.W. Cannon, D.F. Holt, S.V.F. Levy, M.S. Paterson and W.P. Thurston, Word Processing in Groups (Jones & Barlett, 1992).
36. V. Faber and J.W. Moore, High-degree low-diameter interconnection networks with vertex-symmetry: the directed case, Technical Report LA-UR-88-1051, Los Alamos National Laboratory, Los Alamos, New Mexico, 1988.
37. C. Fan, D. Lick, J. Liu, Pseudo-cartesian products and hamiltonian decompositions of Cayley graphs on abelian groups, Discrete Math., to appear.
38. M.F. Foregger, Hamiltonian decompositions of product cycles, Discrete Math., 24 (1978) 251-260.
39. J.A. Gallian, Contemporary Abstract Algebra, (D.C. Heath, Lexington, 3rd ed., 1994).
40. * J.A. Gallian and D. Witte, Hamiltonian checkerboards, Math. Mag. 57 (1984) 291-294.
41. J.A. Gallian and D. Witte, When the cartesian product of two directed cycles is hyperhamiltonian, J. Graph Theory 11 (1987) 21-24.
42. 2(p), Discrete Math., to appear.
43. n, Discrete Math. 66 (1987) 91-102.
44. W. Holsztyński and R.F.E. Strube, Paths and circuits in finite groups, Discrete Math. 22 (1978) 263-272.
45. D. Housman, Enumeration of hamiltonian paths in Cayley diagrams, Aequationes Math. 23 (1981) 80-97.
46. Y. Huang, On Hamiltonian decompositions of Cayley graphs on cyclic groups, in: M.F. Capobianco, M. Guan, D.F. Hsu, F. Tian, eds., Graph Theory and its Applications: East and West, Annals of the New York Academy of Sciences, Vol. 576 (New York Academy of Sciences, New York, 1989).
47. M. Jiang and F. Ruskey, Determining the Hamilton-connectedness of certain vertex-transitive graphs, Discrete Math. 133 (1994) 159-169.
48. b, Univ. of Minnesota, Duluth, Technical Report, 1985.
49. D. Jungreis, Generalized hamiltonian circuits in the cartesian product of two directed cycles, J. Graph Theory, 12 (1988) 113-120.
50. D. Jungreis, Hamiltonian paths in Cayley digraphs of finitely-generated infinite abelian groups, Discrete Math. 78 (1989) 96-104.
51. D. Jungreis, Hamiltonian paths in euclidean crystallographic groups, Univ. of Minnesota, Duluth, Technical Report.
52. D. Jungreis, E. Friedman and D. Witte, Cayley graphs on groups of low order are hamiltonian, Preprint.
53. * I.L. Jungreis, Infinite hamiltonian paths in Cayley digraphs, Discrete Math. 54 (1985) 167-180.
54. J.-S. Jwo, S. Lakshmivarahan and S.K. Dhall, A new class of interconnection networks based on the alternating group, Networks 23 (1993) 315-326.
55. * K. Keating, Multiple-ply hamiltonian graphs and digraphs, Ann. Discrete Math. 27 (1985) 81-88.
56. * K. Keating and D. Witte, On Hamilton cycles in Cayley graphs of groups with cyclic commutator subgroup, in: B.R. Alspach and C.D. Godsil, eds., Cycles in Graphs, Ann. of Discrete Math. 27 (1985) 89-102.
57. J.B. Klerlein and A.G. Starling, Hamiltonian cycles in Cayley color graphs of semi-direct products, Proc. 9th Southeastern Conf. Combinatorics, Graph Theory and Computing, Cong. Numer. 21 (1978) 411-435.
58. J.B. Klerlein and A.G. Starling, Hamiltonian cycles in Cayley color graphs of some special groups, Proc. 10th Southeastern Conf. Combinatorics, Graph Theory and Computing, Cong. Numer. 24 (1979) 595-599.
59. V.L. Kompel'makher and V.A. Liskovets, Sequential generation of arrangements by means of a basis of transpositions, Kibernetica 3 (1975) 17-21.
60. A. Kotzig, Every cartesian product of two circuits is decomposable into two Hamiltonian circuits, Rapport 233, Centre de Recherches Mathématiques, Montréal 1973.
61. S. Lakshmivarahan, J-S. Jwo and S.K. Dhall, Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey, Parallel Comput. 19 (1993) 361-407.
62. * G. Letzter, Hamiltonian circuits in cartesian products with a metacyclic factor, Ann. Discrete Math. 27 (1985) 103-114.
63. D-X. Li, Hamiltonian circuits in Cayley digraph on a cyclic group, Preprint.
64. J. Liu, Hamiltonian decompositions of Cayley graphs on abelian groups, Discrete Math. 131 (1994) 163-171.
65. J. Liu, Further results on hamiltonian decompositions of Cayley graphs on abelian groups, Preprint.
66. A.S. Llado and O. Serra, Hamiltonian cycles in Cayley digraphs with two generators, J. Combin. Inform. System Sci. 15 (1990) 271-280.
67. L. Lovász, Problem 11, in: R. Guy, H. Hanani, N. Sauer and J. Schoneheim, eds., Combinatorial Structures and their Applications (Gordon and Breach, New York, 1970) 497.
68. D. Marušič, Hamiltonian circuits in Cayley graphs, Discrete Math. 46 (1983) 49-54.
69. A. Nijenhuis and H.S. Wilf, Combinatorial Algorithms (Academic Press, New York, 2nd ed., 1978).
70. * L.E. Penn and D. Witte, When the cartesian product of two directed cycles is hypohamiltonian, J. Graph Theory 7 (1983) 441-443.
71. * D.L. Powers, Some hamiltonian Cayley graphs, Ann. Discrete Math. 27 (1985) 129-140.
72. R.A. Rankin, A campanological problem in group theory, Proc. Camb. Phil. Soc. 44 (1948) 17-25.
73. n, Discrete Math. 133 (1994) 217-223.
74. V. Reiner, Personal communication.
75. F. Ruskey, M. Jiang and A. Weston, On the hamiltonicity of directed σ - τ Cayley graphs (or: a tale of backtracking), Discrete Appl. Math. 57 (1995) 75-83.
76. n, SIAM J. Disc. Math. 6 (1993) 152-166.
77. * R. Stong, On hamiltonian cycles in Cayley graphs of wreath products, Discrete Math. 65 (1987) 75-80.
78. R. Stong, Hamilton decompositions of cartesian products of graphs, Discrete Math. 90 (1991) 169-190.
79. M. Tchuente, Generation of permutations by graphical exchanges, Ars Combin. 14 (1982) 115-122.
80. W.T. Trotter, Jr. and P. Erdos, When the cartesian product of directed cycles is hamiltonian, J. Graph Theory 2 (1978) 137-142.
81. A. White, Ringing the cosets, Amer. Math. Monthly 94 (1987) 721-746.
82. H.S. Wilf, Combinatorial Algorithms: An Update, SIAM, CBMS 55, 1989.
83. A.M. Wilkinson, Circuits in Cayley digraphs of finite abelian groups, J. Graph Theory, 14 (1990) 111-116.
84. D. Witte, On hamiltonian circuits in Cayley diagrams, Discrete Math. 38 (1982) 99-108.
85. D. Witte, Cayley digraphs of prime-power order are hamiltonian, J. Combin. Theory Ser. B. 40 (1986) 107-112.
86. D. Witte and J.A. Gallian, A survey: hamiltonian cycles in Cayley graphs, Discrete Math. 51 (1984) 293-304.
87. S.A. Wong, Hamilton cycles and paths in butterfly graphs, Networks 26 (1995) 145-150.
88. M.-Y. Xu, Vertex-primitive digraphs of prime-power order are hamiltonian, Discrete Math. 128 (1994) 415-417.
89. X.D. Zhang and Z.L. Li, Hamiltonian circuits of Cayley digraphs on a cyclic group, J. Systems Sci. Math. Sci. 10 (1990) 169-174.