Proper colouring painter-builder game

DOI10.1016/j.disc.2017.11.008zbMath1378.05044arXiv1612.02156OpenAlexW2560113382MaRDI QIDQ1690226

Clément Requilé, Viola Mészáros, Michael Krivelevich, Małgorzata Bednarska-Bzdȩga

Publication date: 19 January 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1612.02156

zbMATH Keywords

graph colouringcombinatorial games

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15) Combinatorial games (91A46) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• There is no fast method for finding monochromatic complete subgraphs
• On-line Ramsey theory
• On-line Ramsey Numbers
• Probabilistic One-Player Ramsey Games via Deterministic Two-Player Games
• Coloring random graphs online without creating monochromatic subgraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Proper colouring painter-builder game