scientific article; zbMATH DE number 398953
From MaRDI portal
Publication:4201568
zbMath0796.90082MaRDI QIDQ4201568
Ulrich Faigle, Uwe Kern, William T. jun. Trotter, Henry A. Kierstead
Publication date: 25 August 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (83)
Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers ⋮ A simple competitive graph coloring algorithm. III ⋮ The graph distance game and some graph operations ⋮ PSPACE-hardness of two graph coloring games ⋮ On caterpillars of game chromatic number 4 ⋮ Note on the game chromatic index of trees ⋮ The independence coloring game on graphs ⋮ Unnamed Item ⋮ The game chromatic number and the game colouring number of cactuses ⋮ Asymmetric coloring games on incomparability graphs ⋮ Generalised game colouring of graphs ⋮ The relaxed game chromatic index of \(k\)-degenerate graphs ⋮ Unnamed Item ⋮ PSPACE-completeness of two graph coloring games ⋮ The relaxed edge-coloring game and \(k\)-degenerate graphs ⋮ Game-perfect digraphs ⋮ Graph colorings with restricted bicolored subgraphs: II. The graph coloring game ⋮ Game chromatic number of graphs with locally bounded number of cycles ⋮ Adapted game colouring of graphs ⋮ The relaxed game chromatic number of graphs with cut-vertices ⋮ On the game coloring index of \(F^+\)-decomposable graphs ⋮ On the degree of trees with game chromatic number 4 ⋮ Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs ⋮ Indicated coloring of the Mycielskian of some families of graphs ⋮ The game chromatic number and the game colouring number of classes of oriented cactuses ⋮ Bichromatic coloring game on triangulations ⋮ The strong game colouring number of directed graphs ⋮ On monotonicity in maker-breaker graph colouring games ⋮ Note on the game colouring number of powers of graphs ⋮ The complexity of two colouring games ⋮ The connected greedy coloring game ⋮ A note on the connected game coloring number ⋮ The game chromatic index of wheels ⋮ The game Grundy number of graphs ⋮ The game \(L(d,1)\)-labeling problem of graphs ⋮ A simple competitive graph coloring algorithm. II. ⋮ Game chromatic number of generalized Petersen graphs and Jahangir graphs ⋮ The game chromatic index of some trees of maximum degree 4 ⋮ Majority coloring game ⋮ Game chromatic number of toroidal grids ⋮ Refined activation strategy for the marking game ⋮ The game coloring number of planar graphs with a specific girth ⋮ Spanning tree with lower bound on the degrees ⋮ The coloring game on planar graphs with large girth, by a result on sparse cactuses ⋮ Game chromatic number of toroidal grids ⋮ A new upper bound on the game chromatic index of graphs ⋮ The incidence game chromatic number ⋮ Complete multipartite graphs and the relaxed coloring game ⋮ The incidence game chromatic number of paths and subgraphs of wheels ⋮ Directed defective asymmetric graph coloring games ⋮ Decomposition of sparse graphs, with application to game coloring number ⋮ Weak acyclic coloring and asymmetric coloring games ⋮ Very asymmetric marking games ⋮ The game chromatic index of forests of maximum degree \(\Delta \geqslant 5\) ⋮ The game coloring number of planar graphs with a given girth ⋮ The incidence game chromatic number of \((a,d)\)-decomposable graphs ⋮ The difference between game chromatic number and chromatic number of graphs ⋮ Game coloring the Cartesian product of graphs ⋮ The eternal game chromatic number of random graphs ⋮ The 6-relaxed game chromatic number of outerplanar graphs ⋮ Two-player pebbling on diameter 2 graphs ⋮ On the relaxed colouring game and the unilateral colouring game ⋮ Game-perfect graphs ⋮ Lightness of digraphs in surfaces and directed game chromatic number ⋮ Colouring games on outerplanar graphs and trees ⋮ Infinite chromatic games ⋮ Decomposing a graph into forests ⋮ A simple competitive graph coloring algorithm ⋮ Relaxed game chromatic number of trees and outerplanar graphs ⋮ \textsf{PSPACE}-hardness of variants of the graph coloring game ⋮ 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 ⋮ On the game chromatic number of splitting graphs of path and cycle ⋮ The orthogonal colouring game ⋮ A bound for the game chromatic number of graphs ⋮ Game chromatic number of strong product graphs ⋮ The game coloring number of planar graphs ⋮ Game-perfect Graphs with Clique Number 2 ⋮ Uniquely colorable graphs with equal chromatic and game chromatic numbers ⋮ On game chromatic vertex-critical graphs ⋮ Game-perfect semiorientations of forests
This page was built for publication:
