Cite
HARVARD Citation
Anastos, M. et al. (2020). On the connectivity of proper colorings of random graphs and hypergraphs. Random structures & algorithms. 56 (4), pp. 988-997. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Anastos, M. et al. (2020). On the connectivity of proper colorings of random graphs and hypergraphs. Random structures & algorithms. 56 (4), pp. 988-997. [Online].