The game coloring number of pseudo partial \(k\)-trees

DOI10.1016/S0012-365X(99)00237-XzbMath0947.05031OpenAlexW2045411943MaRDI QIDQ1974537

Xuding Zhu

Publication date: 12 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00237-x

zbMATH Keywords

embeddinggenusgame coloring numberpartial \(k\)-trees

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (49)

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 ⋮ The relaxed game chromatic index of \(k\)-degenerate graphs ⋮ Game chromatic index ofk-degenerate graphs ⋮ PSPACE-completeness of two graph coloring games ⋮ On the hat guessing number of a planar graph class ⋮ The relaxed edge-coloring game and \(k\)-degenerate graphs ⋮ Game-perfect digraphs ⋮ Graph colorings with restricted bicolored subgraphs: II. The graph coloring game ⋮ Decomposing planar graphs into graphs with degree restrictions ⋮ Decompositions of graphs of nonnegative characteristic with some forbidden subgraphs ⋮ Adapted game colouring of 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 ⋮ Decomposition of toroidal graphs without some subgraphs ⋮ The strong game colouring number of directed graphs ⋮ Note on the game colouring number of powers of graphs ⋮ The connected greedy coloring game ⋮ A note on the connected game coloring number ⋮ The game Grundy number of graphs ⋮ A simple competitive graph coloring algorithm. II. ⋮ Activation strategy for asymmetric marking games ⋮ Efficient Graph Packing via Game Colouring ⋮ Game chromatic number of toroidal grids ⋮ Refined activation strategy for the marking game ⋮ The game coloring number of planar graphs with a specific girth ⋮ The coloring game on planar graphs with large girth, by a result on sparse cactuses ⋮ Game chromatic number of Cartesian product graphs ⋮ Game chromatic number of toroidal grids ⋮ The specification of 2-trees ⋮ Weak acyclic coloring and asymmetric coloring games ⋮ Very asymmetric marking games ⋮ The game coloring number of planar graphs with a given girth ⋮ Game coloring the Cartesian product of graphs ⋮ The 6-relaxed game chromatic number of outerplanar graphs ⋮ Relaxed very asymmetric coloring games ⋮ Game-perfect 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 ⋮ 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

This page was built for publication: The game coloring number of pseudo partial \(k\)-trees