A bound for the game chromatic number of graphs
From MaRDI portal
Publication:1297403
DOI10.1016/S0012-365X(98)00197-6zbMath0928.05022MaRDI QIDQ1297403
Publication date: 19 January 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
treewidth; acyclic chromatic number; planar graph; game chromatic number; orientable genus; series parallel graphs
05C35: Extremal problems in graph theory
91A43: Games involving graphs
05C15: Coloring of graphs and hypergraphs
Related Items
Game chromatic number of Cartesian product graphs, Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers, Generalised game colouring of graphs, The relaxed game chromatic index of \(k\)-degenerate graphs, On forbidden subdivision characterizations of graph classes, The 6-relaxed game chromatic number of outerplanar graphs, Lightness of digraphs in surfaces and directed game chromatic number, Colouring games on outerplanar graphs and trees, Circular game chromatic number of graphs, The game coloring number of planar graphs, A simple competitive graph coloring algorithm. II., A simple competitive graph coloring algorithm, A simple competitive graph coloring algorithm. III, Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs, Refined activation strategy for the marking game, The game of arboricity, Weak acyclic coloring and asymmetric coloring games, The game chromatic index of forests of maximum degree \(\Delta \geqslant 5\), Unnamed Item, Game coloring the Cartesian product of graphs
Cites Work
