The game chromatic number of random graphs

DOI10.1002/rsa.20179zbMath1139.05017arXiv0707.0465OpenAlexW2963016487WikidataQ57401486 ScholiaQ57401486MaRDI QIDQ5454360

Tom Bohman, Benjamin Sudakov, Alan M. Frieze

Publication date: 28 March 2008

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

chromatic numberrandom bipartite graphrandom graphgame chromatic number

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15)

Related Items

PSPACE-hardness of two graph coloring games, PSPACE-completeness of two graph coloring games, Game-perfect digraphs, On monotonicity in maker-breaker graph colouring games, The connected greedy coloring game, Majority coloring game, The game chromatic number of dense random graphs, Game chromatic index of graphs with given restrictions on degrees, A new upper bound on the game chromatic index of graphs, Indicated coloring of graphs, The eternal game chromatic number of random graphs, On indicated coloring of some classes of graphs, \textsf{PSPACE}-hardness of variants of the graph coloring game