The following publications are possibly variants of this publication:
- Coloring random graphs online without creating monochromatic subgraphsTorsten Mütze, Thomas Rast, Reto Spöhel. rsa, 44(4):419-464, 2014. [doi]
- Coloring random graphs online without creating monochromatic subgraphsTorsten Mütze, Thomas Rast, Reto Spöhel. soda 2011: 145-158 [doi]
- Coloring the edges of a random graph without a monochromatic giant componentReto Spöhel, Angelika Steger, Henning Thomas. endm, 34:615-619, 2009. [doi]
- Coloring the Edges of a Random Graph without a Monochromatic Giant ComponentReto Spöhel, Angelika Steger, Henning Thomas. combinatorics, 17(1), 2010. [doi]
- Online vertex-coloring games in random graphsMartin Marciniszyn, Reto Spöhel. combinatorica, 30(1):105-123, 2010. [doi]