The game Grundy number of graphs

DOI10.1007/s10878-012-9513-8zbMath1272.91041OpenAlexW2042086431MaRDI QIDQ1956234

Xuding Zhu, Frédéric Havet

Publication date: 13 June 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-012-9513-8

zbMATH Keywords

treespartial 2-treescolouring gamegame Grundy number

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57)

Related Items

PSPACE-hardness of two graph coloring games, Asymmetric coloring games on incomparability graphs, PSPACE-completeness of two graph coloring games, On monotonicity in maker-breaker graph colouring games, Grundy coloring in some subclasses of bipartite graphs and their complements, The connected greedy coloring game, The game Grundy indices of graphs, The median game

Cites Work

• Unnamed Item
• Marking games and the oriented game chromatic number of partial \(k\)-trees
• A simple competitive graph coloring algorithm. II.
• A simple competitive graph coloring algorithm
• Orderings on graphs and game coloring number
• A simple competitive graph coloring algorithm. III
• The game coloring number of pseudo partial \(k\)-trees
• Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs
• Refined activation strategy for the marking game
• Very asymmetric marking games
• Game coloring the Cartesian product of graphs
• ON THE COMPLEXITY OF SOME COLORING GAMES
• Game chromatic number of outerplanar graphs
• Radius two trees specify χ‐bounded classes
• Edge-partitions of planar graphs and their game coloring numbers
• The Map-Coloring Game
• Competitive colorings of oriented graphs
• On the oriented game chromatic number