A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Hamiltonian cycles in certain graphs

1978
*
Journal of the Australian Mathematical Society
*

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. of the problem in the case g = 1 exists if and only if G nm has a Hamiltonian cycle. The case n = 2k-1, m = k-1, g = 1 has been considered by several authors. Meredith and Lloyd (1972)

doi:10.1017/s1446788700011563
fatcat:eaidrkyf7je23fteqcq3ee6q3e