The footballers of Croam

DOI10.1016/0095-8956(73)90016-6MaRDI QIDQ2556423zbMATH OpenOpenAlexWikidataFDO

Authors 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

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

Cited in

(12)

• 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
• Sparse Kneser graphs are Hamiltonian
• Towards the Chen-Raspaud conjecture
• Kneser graphs are Hamiltonian
• Kneser graphs are Hamiltonian (extended abstract)
• Kneser graphs are Hamiltonian

This page was built for publication: The footballers of Croam

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2556423)