scientific article; zbMATH DE number 398953
From MaRDI portal
Publication:4201568
zbMATH Open0796.90082MaRDI QIDQ4201568FDOQ4201568
Authors: U. Faigle, Uwe Kern, H. A. Kierstead, William T. Trotter 
Publication date: 25 August 1993
Title of this publication is not available (Why is that?)
Recommendations
Cited In (only showing first 100 items - show all)
- Note on the game chromatic index of trees
- Very asymmetric marking games
- Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers
- The game of arboricity
- The incidence game chromatic number
- Game chromatic number of graphs with locally bounded number of cycles
- Adapted game colouring of graphs
- Directed defective asymmetric graph coloring games
- Asymmetric directed graph coloring games
- A new upper bound on the game chromatic index of graphs
- The game chromatic number and the game colouring number of classes of oriented cactuses
- The game chromatic index of forests of maximum degree \(\Delta \geqslant 5\)
- The graph distance game and some graph operations
- Generalised game colouring of graphs
- Game chromatic index of graphs with given restrictions on degrees
- Majority coloring game
- Game-perfect graphs
- Colouring games on outerplanar graphs and trees
- The Map-Coloring Game
- Circular game chromatic number of graphs
- The incidence game chromatic number of paths and subgraphs of wheels
- On the game chromatic number of sparse random graphs
- The orthogonal colouring game
- On the oriented game chromatic number
- The game chromatic number and the game colouring number of cactuses
- The connected greedy coloring game
- Game colouring of the square of graphs
- The incidence game chromatic number of \((a,d)\)-decomposable graphs
- A bound for the game chromatic number of graphs
- The relaxed edge-coloring game and \(k\)-degenerate graphs
- The relaxed game chromatic number of graphs with cut-vertices
- On the game chromatic number of splitting graphs of path and cycle
- Title not available (Why is that?)
- The game \(L(d,1)\)-labeling problem of graphs
- The game chromatic number of trees and forests
- On the relaxed colouring game and the unilateral colouring game
- The relaxed game chromatic index of \(k\)-degenerate graphs
- The 6-relaxed game chromatic number of outerplanar graphs
- Weak acyclic coloring and asymmetric coloring games
- Indicated coloring of the Mycielskian of some families of graphs
- On the game coloring index of \(F^+\)-decomposable graphs
- Game chromatic number of toroidal grids
- The game chromatic number of some join graphs
- A simple competitive graph coloring algorithm. II.
- Note on the game colouring number of powers of graphs
- Colouring game and generalized colouring game on graphs with cut-vertices
- Spanning tree with lower bound on the degrees
- The game chromatic index of some trees of maximum degree 4
- The game coloring number of planar graphs
- The game chromatic number of random graphs
- Relaxed game chromatic number of trees and outerplanar graphs
- The game chromatic number of dense random graphs
- A simple competitive graph coloring algorithm. III
- The game chromatic index of wheels
- Decomposing a graph into forests
- A simple competitive graph coloring algorithm
- Decomposition of sparse graphs, with application to game coloring number
- Complete multipartite graphs and the relaxed coloring game
- Lightness of digraphs in surfaces and directed game chromatic number
- Game chromatic number of Cartesian and corona product graphs
- The game Grundy number of graphs
- The coloring game on planar graphs with large girth, by a result on sparse cactuses
- Game chromatic number of strong product graphs
- Game coloring the Cartesian product of graphs
- Game chromatic number of some network graphs
- Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs
- Refined activation strategy for the marking game
- On game chromatic vertex-critical graphs
- Game chromatic number of generalized Petersen graphs and Jahangir graphs
- On the degree of trees with game chromatic number 4
- The strong game colouring number of directed graphs
- The game coloring number of planar graphs with a specific girth
- Infinite chromatic games
- Game-perfect semiorientations of forests
- Playing a game to bound the chromatic number
- On caterpillars of game chromatic number 4
- The game coloring number of planar graphs with a given girth
- Introduction to competitive graph coloring
- Game chromatic number of toroidal grids
- The complexity of two colouring games
- The two forests game and the four colour theorem
- Bichromatic coloring game on triangulations
- The eternal game chromatic number of random graphs
- Graph colorings with restricted bicolored subgraphs: II. The graph coloring game
- Two-player pebbling on diameter 2 graphs
- The difference between game chromatic number and chromatic number of graphs
- The game of arboricity
- Equality perfect graphs and digraphs
- The independence coloring game on graphs
- On monotonicity in maker-breaker graph colouring games
- On graphs with maximum difference between game chromatic number and chromatic number
- Game-perfect digraphs
- Bounded families for the on-line \(t\)-relaxed coloring
- The complexity of coloring games on perfect graphs
- \textsf{PSPACE}-hardness of variants of the graph coloring game
- PSPACE-hardness of two graph coloring games
- PSPACE-completeness of two graph coloring games
- Title not available (Why is that?)
- A note on the connected game coloring number
- Proper 2-coloring game on some trees
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4201568)
