Marking games and the oriented game chromatic number of partial \(k\)-trees
From MaRDI portal
Publication:1396657
DOI10.1007/s00373-002-0489-5zbMath1026.05039MaRDI QIDQ1396657
Zsolt Tuza, Henry A. Kierstead
Publication date: 8 July 2003
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-002-0489-5
Related Items
The game chromatic number and the game colouring number of cactuses, The relaxed game chromatic index of \(k\)-degenerate graphs, Colouring games on outerplanar graphs and trees, A simple competitive graph coloring algorithm. II., The game Grundy number of graphs, Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs, Refined activation strategy for the marking game, Weak acyclic coloring and asymmetric coloring games, Marking Games, Efficient Graph Packing via Game Colouring, Game coloring the Cartesian product of graphs