On monotonicity in maker-breaker graph colouring games

DOI10.1016/j.dam.2024.01.007arXiv2308.03528OpenAlexW4391018671MaRDI QIDQ6202940

Lawrence Hollom

Publication date: 27 February 2024

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

Full work available at URL: https://arxiv.org/abs/2308.03528

zbMATH Keywords

game chromatic numbergame arboricitygraph colouring gamevertex colouring game

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Unnamed Item
• The game chromatic number of dense random graphs
• The coloring game on matroids
• The game chromatic number and the game colouring number of cactuses
• The game coloring number of planar graphs
• Majority coloring game
• The game coloring number of planar graphs with a specific girth
• Indicated coloring of graphs
• The game Grundy number of graphs
• The game coloring number of planar graphs with a given girth
• Hardness of variants of the graph coloring game
• PSPACE-completeness of two graph coloring games
• A connected version of the graph coloring game
• Refined activation strategy for the marking game
• The game of arboricity
• The connected greedy coloring game
• A note on the connected game coloring number
• Game chromatic index ofk-degenerate graphs
• On the Game Chromatic Number of Sparse Random Graphs
• Domination Game and an Imagination Strategy
• ON THE COMPLEXITY OF SOME COLORING GAMES
• Radius two trees specify χ‐bounded classes
• The game chromatic number of random graphs