The game coloring number of planar graphs

zbMath0933.05052MaRDI QIDQ1305532

Xuding Zhu

Publication date: 4 April 2000

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

planar graphgame chromatic numbergame coloring numbercoloring game

Mathematics Subject Classification ID

Games involving graphs (91A43) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (84)

Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers ⋮ A simple competitive graph coloring algorithm. III ⋮ PSPACE-hardness of two graph coloring games ⋮ On caterpillars of game chromatic number 4 ⋮ The game chromatic number and the game colouring number of cactuses ⋮ Asymmetric coloring games on incomparability graphs ⋮ Game chromatic number of direct product of some families of graphs ⋮ On indicated coloring of lexicographic product of graphs ⋮ On a vertex-edge marking game on graphs ⋮ Generalised game colouring of graphs ⋮ The relaxed game chromatic index of \(k\)-degenerate graphs ⋮ PSPACE-completeness of two graph coloring games ⋮ The relaxed edge-coloring game and \(k\)-degenerate graphs ⋮ Decomposition of sparse graphs into two forests, one having bounded maximum degree ⋮ Coloring games on squares of graphs ⋮ A connected version of the graph coloring game ⋮ On the game coloring index of \(F^+\)-decomposable graphs ⋮ The edge coloring game on trees with the number of colors greater than the game chromatic index ⋮ 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 ⋮ 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 \(L(d,1)\)-labeling problem of graphs ⋮ A simple competitive graph coloring algorithm. II. ⋮ Game chromatic number of generalized Petersen graphs and Jahangir graphs ⋮ Activation strategy for asymmetric marking games ⋮ Majority coloring game ⋮ Indicated coloring of matroids ⋮ On Nordhaus-Gaddum type inequalities for the game chromatic and game coloring numbers ⋮ A note on the game chromatic index of graphs ⋮ Decomposing a graph into pseudoforests with one having bounded degree ⋮ Game chromatic number of toroidal grids ⋮ Refined activation strategy for the marking game ⋮ The game Grundy indices of graphs ⋮ The game coloring number of planar graphs with a specific girth ⋮ Spanning tree with lower bound on the degrees ⋮ The coloring game on matroids ⋮ The coloring game on planar graphs with large girth, by a result on sparse cactuses ⋮ On-line list coloring of matroids ⋮ The median game ⋮ Game chromatic number of toroidal grids ⋮ The game of arboricity ⋮ Asymmetric marking games on line graphs ⋮ The incidence game chromatic number of paths and subgraphs of wheels ⋮ Indicated coloring of graphs ⋮ Directed defective asymmetric graph coloring games ⋮ Decomposition of sparse graphs, with application to game coloring number ⋮ Weak acyclic coloring and asymmetric coloring games ⋮ The game coloring number of planar graphs with a given girth ⋮ The incidence game chromatic number of \((a,d)\)-decomposable graphs ⋮ Decomposing a graph into forests: the nine dragon tree conjecture is true ⋮ Game coloring the Cartesian product of graphs ⋮ The eternal game chromatic number of random graphs ⋮ The 6-relaxed game chromatic number of outerplanar graphs ⋮ The game chromatic number of corona of two graphs ⋮ On the relaxed colouring game and the unilateral colouring game ⋮ Relaxed very asymmetric coloring games ⋮ On indicated coloring of some classes of graphs ⋮ Lightness of digraphs in surfaces and directed game chromatic number ⋮ Colouring games on outerplanar graphs and trees ⋮ Activation strategy for relaxed asymmetric coloring games ⋮ Infinite chromatic games ⋮ Decomposing a graph into forests ⋮ Strong Chromatic Index of Sparse Graphs ⋮ 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 ⋮ Generalization of transitive fraternal augmentations for directed graphs and its applications ⋮ Asymmetric directed graph coloring games ⋮ On the game chromatic number of splitting graphs of path and cycle ⋮ A bound for the game chromatic number of graphs ⋮ Game chromatic number of strong product graphs ⋮ Marking Games ⋮ Uniquely colorable graphs with equal chromatic and game chromatic numbers ⋮ Game-perfect semiorientations of forests

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs
• On acyclic colorings of planar graphs
• A bound for the game chromatic number of graphs
• Unterteilungen vollständiger Graphen in Graphen mit unendlicher chromatischer Zahl
• Acyclic and oriented chromatic numbers of graphs
• ON THE COMPLEXITY OF SOME COLORING GAMES
• Structural Properties of Planar Maps with the Minimal Degree 5
• An acyclic analogue to Heawood's theorem
• Game chromatic number of outerplanar graphs
• Radius two trees specify χ‐bounded classes
• On Light Edges and Triangles in Planar Graphs of Minimum Degree Five
• Über eine von H. S. WILF angegebene Schranke für die chromatische Zahl endlicher Graphen
• k-Degenerate Graphs
• Decomposition of Finite Graphs Into Forests

This page was built for publication: The game coloring number of planar graphs