Game chromatic number of graphs with locally bounded number of cycles

DOI10.1016/j.ipl.2010.06.004zbMath1234.05090OpenAlexW2013923163MaRDI QIDQ407532

łukasz Roẓej, Konstanty Junosza-Szaniawski

Publication date: 27 March 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.06.004

zbMATH Keywords

combinatorial problemsgame chromatic numbercompetitive algorithmsgame coloring number

Mathematics Subject Classification ID

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 and the game colouring number of cactuses
• Decomposition of sparse graphs, with application to game coloring number
• A simple competitive graph coloring algorithm
• Refined activation strategy for the marking game
• ON THE COMPLEXITY OF SOME COLORING GAMES
• The Map-Coloring Game