Uniquely colorable graphs with equal chromatic and game chromatic numbers

DOI10.1142/S1793830921501196zbMath1487.05178OpenAlexW3158156145MaRDI QIDQ5866017

Naoki Matsumoto

Publication date: 10 June 2022

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830921501196

zbMATH Keywords

chromatic numbergame chromatic numberuniquely colorable graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Size of edge-critical uniquely 3-colorable planar graphs
• The game coloring number of planar graphs
• A simple competitive graph coloring algorithm
• The difference between game chromatic number and chromatic number of graphs
• Refined activation strategy for the marking game
• On the coloring of signed graphs
• Acyclic and oriented chromatic numbers of graphs
• Efficient Graph Packing via Game Colouring
• ON THE COMPLEXITY OF SOME COLORING GAMES
• Radius two trees specify χ‐bounded classes
• Uniquely colorable Cayley graphs
• The Map-Coloring Game
• Uniquely colorable graphs