Publication:4256107
From MaRDI portal
DOI<67::AID-JGT7>3.0.CO;2-M 10.1002/(SICI)1097-0118(199901)30:1<67::AID-JGT7>3.0.CO;2-MzbMath0929.05032MaRDI QIDQ4256107
No author found.
Publication date: 28 June 1999
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
Related Items
Game chromatic number of Cartesian product graphs, Game chromatic number of toroidal grids, The incidence game chromatic number, The incidence game chromatic number of paths and subgraphs of wheels, The game chromatic index of wheels, Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers, The game chromatic number and the game colouring number of cactuses, Generalised game colouring of graphs, The relaxed game chromatic index of \(k\)-degenerate graphs, The 6-relaxed game chromatic number of outerplanar graphs, Game-perfect graphs, Lightness of digraphs in surfaces and directed game chromatic number, Colouring games on outerplanar graphs and trees, Circular game chromatic number of graphs, Game colouring of the square of graphs, Asymmetric directed graph coloring games, A bound for the 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, Relaxed game chromatic number of trees and outerplanar graphs, 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, Very asymmetric marking games, Unnamed Item, Marking Games, Game coloring the Cartesian product of graphs
Cites Work
