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 graph; game chromatic number; game coloring number; coloring game

Mathematics Subject Classification ID

91A43: Games involving graphs

05C10: Planar graphs; geometric and topological aspects of graph theory

05C15: Coloring of graphs and hypergraphs

Related Items

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, Activation strategy for asymmetric marking games, A note on the game chromatic index of graphs, The 6-relaxed game chromatic number of outerplanar graphs, Relaxed very asymmetric coloring games, Lightness of digraphs in surfaces and directed game chromatic number, Colouring games on outerplanar graphs and trees, Activation strategy for relaxed asymmetric coloring games, 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, A bound for the game chromatic number of 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, The game of arboricity, Asymmetric marking games on line graphs, Weak acyclic coloring and asymmetric coloring games, Marking Games, Game coloring the Cartesian product of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• ON THE COMPLEXITY OF SOME COLORING GAMES
• Structural Properties of Planar Maps with the Minimal Degree 5
• An acyclic analogue to Heawood's theorem
• 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