Author:
Heinrich Katherine,Wallis W. D.
Abstract
AbstractIt 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.
Publisher
Cambridge University Press (CUP)
Reference9 articles.
1. Note on Hamilton Circuits
2. The rugby footballers of croam
3. Chemical graphs, Part XIII: Combinatorial patters;Balaban;Rev. Roumaine Math. Pures Appl.,1972
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Kneser Graphs Are Hamiltonian;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
2. Kneser graphs are Hamiltonian;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023
3. Sparse Kneser graphs are Hamiltonian;Journal of the London Mathematical Society;2020-12-10
4. New Algorithms for Hamiltonian Cycle Under Interval Neutrosophic Environment;Advances in Data Mining and Database Management;2020
5. A minimum-change version of the Chung–Feller theorem for Dyck paths;European Journal of Combinatorics;2018-03