Marking games and the oriented game chromatic number of partial \(k\)-trees

DOI10.1007/s00373-002-0489-5zbMath1026.05039OpenAlexW2041300188MaRDI 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

zbMATH Keywords

marking gamepartial treeoriented game chromatic number

Mathematics Subject Classification ID

Trees (05C05) Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15)

Related Items (13)

Homomorphisms and colourings of oriented graphs: an updated survey ⋮ The game chromatic number and the game colouring number of cactuses ⋮ The relaxed game chromatic index of \(k\)-degenerate graphs ⋮ The relaxed edge-coloring game and \(k\)-degenerate graphs ⋮ Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs ⋮ The game Grundy number of graphs ⋮ A simple competitive graph coloring algorithm. II. ⋮ Efficient Graph Packing via Game Colouring ⋮ Refined activation strategy for the marking game ⋮ Weak acyclic coloring and asymmetric coloring games ⋮ Game coloring the Cartesian product of graphs ⋮ Colouring games on outerplanar graphs and trees ⋮ Marking Games

This page was built for publication: Marking games and the oriented game chromatic number of partial \(k\)-trees