Cite
HARVARD Citation
Casselgren, C. (2018). Coloring graphs of various maximum degree from random lists. Random structures & algorithms. 52 (1), pp. 54-73. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Casselgren, C. (2018). Coloring graphs of various maximum degree from random lists. Random structures & algorithms. 52 (1), pp. 54-73. [Online].