A Hamilton cycle in the Cayley graph of the 〈2, p, 3〉 presentation of PSL2(p)

Discrete Mathematics

Volumn 160, Issue 1-3, 1996, Pages 149-163

  Glover, H H ^a   Yang, T Y ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0043134961     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(95)00155-P     Document Type: Article

References (6)

1. B. Alspach, The search for long paths and cycles in vertex-transitive graphs and digraphs, in: K.L. McAvency, ed., Combinatorial Mathematics VIII, Lecture Note in Math., Vol. 884 (Springer, Berlin, 1981) 14-22.
2. M. Cherkassoff and D. Sjerve, On groups generated by three involutions, two of which commute, The Hilton symposium 1993, CRM Proceedings and Lecture Notes 6 (1994) 169-185.
3. D. Gorenstein, Finite Groups (Chelsea Publication, New York, 1980).
4. L. Lovász, problem 11, Combinatorial Structure and their Applications, (Gordon and Breach, New York, 1970).
5. D. Marušič, Hamiltonian circuits in Cayley graphs, Discrete Math. 46 (1983) 49-54.
6. D. Witte and J.A. Gallian, A survey: Hamiltonian cycles in Cayley graphs, Discrete Math. 51 (1984) 293-304.