Coloring random graphs online without creating monochromatic subgraphs

MaRDI QIDQ5365033zbMATH OpenFDO

Authors Torsten Mütze, Thomas Rast, Reto Spöhel

Publication date 29 September 2017

Full work available at URL http://dl.acm.org/citation.cfm?id=2133049

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Applications of game theory (91A80)

Recommendations

• scientific article; zbMATH DE number 6381676
• Coloring random graphs online without creating monochromatic subgraphs
• Online vertex-coloring games in random graphs
• Balanced online Ramsey games in random graphs
• Online Ramsey games in random graphs

Cited in

(3)

• Randomized online graph coloring
• On-line list colouring of random graphs
• Coloring random graphs online without creating monochromatic subgraphs

This page was built for publication: Coloring random graphs online without creating monochromatic subgraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5365033)