A note on the connected game coloring number

DOI10.1016/j.dam.2023.02.017OpenAlexW3033173111MaRDI QIDQ2700603

Peter Bradshaw

Publication date: 27 April 2023

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

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

zbMATH Keywords

connected game coloring numberouterplanar 2-tree with connected game coloring number 5

Mathematics Subject Classification ID

Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15) Theory of computing (68Qxx) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (1)

On monotonicity in maker-breaker graph colouring games

Cites Work

• Unnamed Item
• Unnamed Item
• A bound for the game chromatic number of graphs
• The game coloring number of planar graphs
• A simple competitive graph coloring algorithm
• Reconfiguration in bounded bandwidth and tree-depth
• The game coloring number of pseudo partial \(k\)-trees
• A connected version of the graph coloring game
• Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs
• Refined activation strategy for the marking game
• ON THE COMPLEXITY OF SOME COLORING GAMES
• On Tractable Parameterizations of Graph Isomorphism
• On chromatic number of graphs and set-systems

This page was built for publication: A note on the connected game coloring number