Hostname: page-component-848d4c4894-ttngx Total loading time: 0 Render date: 2024-06-08T18:06:13.554Z Has data issue: false hasContentIssue false
  • English
  • Français

Hamiltonian cycles in certain graphs

Published online by Cambridge University Press:  09 April 2009

Katherine Heinrich  and
W. D. Wallis
Katherine Heinrich
Affiliation:
Department of Mathematics University of Newcastle Newcastle, N.S.W. 2308
W. D. Wallis
Affiliation:
Department of Mathematics University of Newcastle Newcastle, N.S.W. 2308
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

It is observed that arrays which arise in the scheduling of tournaments exist if and only if there are Hamiltonian cycles in certain graphs. The graphs are generalizations of those which arise in the “Footballers of Croam” problem. It is proven that such Hamiltonian cycles exist in infinite classes of the graphs.

Subject classification (Amer. Math. Soc. (MOS) 1970): 05 C 35, 05 B 30.

Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 26 , Issue 1 , August 1978 , pp. 89 - 98
Copyright
Copyright © Australian Mathematical Society 1978

References

Balaban, A. T. (1972), “Chemical graphs, Part XIII: Combinatorial patters”, Rev. Roumaine Math. Pures Appl. 17, 3–16Google Scholar
Baranyai, Zs. (1975), “On the factorization of the complete uniform hypergraph”, Infinite and Finite Sets, Vol. 1, pp. 91–108 (North-Holland Publishing Co.).Google Scholar
Grant, Douglas D. (1975), “How to run a hockey tournament—a combinatorial scheduling problem”, Proc. 5th British Combinatorial Conf., pp. 239–254 (Utilitas Math. Pub. Co., Winnipeg).Google Scholar
Hall, P. (1935), “On representatives of subsets”, J. London Math. Soc. 10, 26–30.CrossRefGoogle Scholar
Mather, Michael (1976), “The Rugby footballers of Croam”, J. Combinatorial Theory (Series B), 20, 62–63.CrossRefGoogle Scholar
Meredith, Guy H. J. and Lloyd, E. Keith (1972), “The Hamiltonian graphs 04 to 07”, Combinatorics (Institute of Mathematics and its Applications, Southend-on-Sea).Google Scholar
Meredith, Guy H. J. and Lloyd, E. Keith (1973). “The footballers of Croam”, J. Combinatorial Theory (Series B), 15, 161–166.CrossRefGoogle Scholar
Ore, Oystein (1960), “Note on Hamilton circuits”, American Math. Monthly, 67, 55.CrossRefGoogle Scholar
Street, Anne Penfold and Wallis, W. D. (1977), Combinatorial Theory; An Introduction (C.B.R.C., Winnipeg).Google Scholar