The game chromatic number of trees and forests

zbMath1327.05107arXiv1410.5223MaRDI QIDQ3455027

Victor Larsen, Charles Dunn, Dustin Toci, Troy Retter, Kira Lindke

Publication date: 3 December 2015

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

zbMATH Keywords

game chromatic numberforest

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (8)

PSPACE-hardness of two graph coloring games ⋮ On caterpillars of game chromatic number 4 ⋮ PSPACE-completeness of two graph coloring games ⋮ On the degree of trees with game chromatic number 4 ⋮ The connected greedy coloring game ⋮ The coloring game on planar graphs with large girth, by a result on sparse cactuses ⋮ \textsf{PSPACE}-hardness of variants of the graph coloring game ⋮ On game chromatic vertex-critical graphs

This page was built for publication: The game chromatic number of trees and forests