The footballers of Croam
From MaRDI portal
Publication:2556423
DOI10.1016/0095-8956(73)90016-6zbMath0248.05129WikidataQ56390689 ScholiaQ56390689MaRDI QIDQ2556423
G. H. J. Meredith, E. Keith Lloyd
Publication date: 1973
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(73)90016-6
Related Items
Sparse Kneser graphs are Hamiltonian, Hamiltonian uniform subset graphs, On regular graphs and Hamiltonian circuits, including answers to some questions of Joseph Zaks, Subgraph distances in graphs defined by edge transfers, Triangle-free Hamiltonian Kneser graphs, NP-completeness of a family of graph-colouring problems, The Rugby footballers of Croam, Binary codes and partial permutation decoding sets from the odd graphs
Cites Work