The connected greedy coloring game

DOI10.1016/j.tcs.2022.10.034OpenAlexW4307723256MaRDI QIDQ2699943

Thiago Marcilon, Rudini Menezes Sampaio, Nícolas A. Martins, Carlos Vinícius G. C. Lima

Publication date: 20 April 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.10.034

zbMATH Keywords

game chromatic numbergraph coloring gamePSPACE-hardnessgame Grundy numberconnected coloring gamegreedy coloring game

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

On monotonicity in maker-breaker graph colouring games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymmetric coloring games on incomparability graphs
• Connected sequential colourings
• A tree representation for \(P_ 4\)-sparse graphs
• On the complexity of some two-person perfect-information games
• The game coloring number of planar graphs
• Hard-to-color graphs for connected sequential colorings
• The game Grundy number of graphs
• The game coloring number of pseudo partial \(k\)-trees
• \textsf{PSPACE}-hardness of variants of the graph coloring game
• Hardness of variants of the graph coloring game
• PSPACE-hardness of two graph coloring games
• PSPACE-completeness of two graph coloring games
• A connected version of the graph coloring game
• Refined activation strategy for the marking game
• The game chromatic number of trees and forests
• On-line and first fit colorings of graphs
• Game chromatic number of outerplanar graphs
• Radius two trees specify χ‐bounded classes
• Characterising and recognising game-perfect graphs
• Connected Greedy Colourings
• The game chromatic number of random graphs
• Automata, Languages and Programming
• Game chromatic number of Cartesian product graphs
• Graph colorings with restricted bicolored subgraphs: II. The graph coloring game

This page was built for publication: The connected greedy coloring game