Cite
HARVARD Citation
Harris, D. et al. (2016). A note on near‐optimal coloring of shift hypergraphs1. Random structures & algorithms. 48 (1), pp. 53-56. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Harris, D. et al. (2016). A note on near‐optimal coloring of shift hypergraphs1. Random structures & algorithms. 48 (1), pp. 53-56. [Online].