Publication:4201568

zbMath0796.90082MaRDI QIDQ4201568

Ulrich Faigle, Henry A. Kierstead, William T. jun. Trotter, Uwe Kern

Publication date: 25 August 1993

zbMATH Keywords

two-person game on the graph

Mathematics Subject Classification ID

05C05: Trees

91A43: Games involving graphs

05C15: Coloring of graphs and hypergraphs

Related Items

Game chromatic number of toroidal grids, Game chromatic number of toroidal grids, The incidence game chromatic number, Game chromatic number of graphs with locally bounded number of cycles, Adapted game colouring of graphs, The game \(L(d,1)\)-labeling problem of graphs, The incidence game chromatic number of paths and subgraphs of wheels, The game chromatic index of wheels, Decomposing a graph into forests, 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, Directed defective asymmetric graph coloring games, Decomposition of sparse graphs, with application to game coloring number, 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, Bounded families for the on-line \(t\)-relaxed coloring, 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, Complete multipartite graphs and the relaxed coloring game, Relaxed game chromatic number of trees and outerplanar graphs, A simple competitive graph coloring algorithm. III, Note on the game chromatic index of trees, Game-perfect digraphs, The game chromatic number and the game colouring number of classes of oriented cactuses, The strong game colouring number of directed graphs, 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, Very asymmetric marking games, The game chromatic index of forests of maximum degree \(\Delta \geqslant 5\), Game-perfect Graphs with Clique Number 2, Game coloring the Cartesian product of graphs