This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brian Alspach, Hamiltonian cycles in vertex-transitive graphs of order 2p, Proc. Tenth Southeastern Conf. Combinatorics, Graph Theory and Computing, Congress. Num. XXIII, Utilitas Math., Winnipeg, 1979, 131–139.
Brian Alspach and Richard J. Sutcliffe, Vertex-transitive graphs of order 2p, Annals N. Y. Acad. Sci., 319 (1979), 19–27.
László Babai, Long cycles in vertex-transitive graphs, J. Graph Theory, 3 (1979), 301–304.
László Babai, On the complexity of canonical labeling of strongly regular graphs, SIAM J. Comput., 9 (1980), 212–216.
Kozo Bannai, Hamiltonian cycles in generalized Petersen graphs, J. Combinatorial Theory Ser. B, 24 (1978), 181–188.
J. A. Bondy and U. S. R. Murty, Graph theory with applications, American Elsevier, New York, 1976.
C. C. Chen and N. F. Quimpo, On some classes of hamiltonian graphs, Southeast Asian Bull. Math., Special issue (1979), 252–258.
C. C. Chen and N. F. Quimpo, On strongly hamiltonian abelian group graphs, Lecture Notes in Mathematics, this volume, 1981, Springer-Verlag, Berlin.
W. Holsztyński and R. F. E. Strube, Paths and circuits in finite groups, Discrete Math., 22 (1978), 263–272.
Joseph B. Klerlein, Hamiltonian cycles in Cayley color graphs, J. Graph Theory, 2 (1978), 65–68.
Joseph B. Klerlein and A. Gregory Starling, Hamiltonian cycles in Cayley color graphs of semi-direct products, Proc. Ninth Southeastern Conf. Combinatorics, Graph Theory and Computing, Congress. Num. XXI, Utilitas Math., Winnipeg, 1978, 411–435.
Joseph B. Klerlein and A. Gregory Starling, Hamiltonian cycles in Cayley color graphs of some special groups, preprint.
Lawrence Lee, On the hamiltonian connectedness of graphs, M. Sc. Thesis, Simon Fraser University, 1980.
László Lovász, Problem 11, Combinatorial structures and their applications, Gordon and Breach, New York, 1970.
W. Mader, Ein Eigenschaft der Atome endlicher Graphen, Arch. Math. (Basel), 22 (1971), 333–336.
Dragan Marušič, On vertex symmetric digraphs, Discrete Math., to appear.
Dragan Marušič, Hamiltonian circuits in Cayley graphs, preprint.
Dragan Marušič, Hamiltonian circuits in vertex-symmetric graphs of order 3p, preprint.
Dragan Marušič and T. D. Parsons, Hamiltonian paths in vertex-symmetric graphs of order 4p, preprint.
Dragan Marušič and T. D. Parsons, Hamiltonian paths in vertex-symmetric graphs of order 5p, preprint.
A. Nijenhuis and H. Wilf, Combinatorial algorithms, second edition, NEXPER Chap., Academic Press, New York, 1978.
Norman F. Quimpo, Hamiltonian properties of group graphs, Ph. D. Thesis, Ateneo de Manila Univ., Philippines, 1980.
William T. Trotter, Jr. and Paul Erdös, When the cartesian product of directed cycles is hamiltonian, J. Graph Theory, 2 (1978), 137–142.
James M. Turner, On point symmetric graphs with a prime number of points, J. Combinatorial Theory, 3 (1967), 136–145.
M. E. Watkins, Connectivity of transitive graphs, J. Combinatorial Theory, 8 (1970), 23–29.
Helmut Wielandt, Finite permutation groups, Academic Press, New York, 1964.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag
About this paper
Cite this paper
Alspach, B. (1981). The search for long paths and cycles in vertex-transitive graphs and digraphs. In: McAvaney, K.L. (eds) Combinatorial Mathematics VIII. Lecture Notes in Mathematics, vol 884. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0091804
Download citation
DOI: https://doi.org/10.1007/BFb0091804
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10883-2
Online ISBN: 978-3-540-38792-3
eBook Packages: Springer Book Archive