On the Game Chromatic Number of Sparse Random Graphs

DOI10.1137/120861953zbMath1272.05120arXiv1201.0046OpenAlexW2001104520WikidataQ57401430 ScholiaQ57401430MaRDI QIDQ2848537

Simcha Haber, Mikhail Lavrov, Alan M. Frieze

Publication date: 26 September 2013

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

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

zbMATH Keywords

random graphsgame chromatic numbersparse

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Games on graphs (graph-theoretic aspects) (05C57) Density (toughness, etc.) (05C42)

Related Items (4)

On monotonicity in maker-breaker graph colouring games ⋮ The game chromatic number of dense random graphs ⋮ A new upper bound on the game chromatic index of graphs ⋮ The eternal game chromatic number of random graphs

This page was built for publication: On the Game Chromatic Number of Sparse Random Graphs