The footballers of Croam

DOI10.1016/0095-8956(73)90016-6zbMath0248.05129OpenAlexW1996675574WikidataQ56390689 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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items

Subgraph distances in graphs defined by edge transfers, On regular graphs and Hamiltonian circuits, including answers to some questions of Joseph Zaks, Towards the Chen-Raspaud conjecture, Triangle-free Hamiltonian Kneser graphs, Binary codes and partial permutation decoding sets from the odd graphs, NP-completeness of a family of graph-colouring problems, The Rugby footballers of Croam, Sparse Kneser graphs are Hamiltonian, Hamiltonian uniform subset graphs

Cites Work

• Unnamed Item