Martin Marciniszyn, Reto Spöhel. Online vertex colorings of random graphs without monochromatic subgraphs. In Nikhil Bansal, Kirk Pruhs, Clifford Stein, editors, Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007. pages 486-493, SIAM, 2007. [doi]
@inproceedings{MarciniszynS07,
title = {Online vertex colorings of random graphs without monochromatic subgraphs},
author = {Martin Marciniszyn and Reto Spöhel},
year = {2007},
doi = {10.1145/1283383.1283435},
url = {http://doi.acm.org/10.1145/1283383.1283435},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/MarciniszynS07},
cites = {0},
citedby = {0},
pages = {486-493},
booktitle = {Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007},
editor = {Nikhil Bansal and Kirk Pruhs and Clifford Stein},
publisher = {SIAM},
isbn = {978-0-898716-24-5},
}