Uniquely colorable graphs with equal chromatic and game chromatic numbers

DOI10.1142/S1793830921501196MaRDI QIDQ5866017zbMATH OpenOpenAlexFDO

Authors 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

• A simple competitive graph coloring algorithm
• Acyclic and oriented chromatic numbers of graphs
• Efficient graph packing via game colouring
• Graph theory
• scientific article; zbMATH DE number 398953 (Why is no real title available?)
• scientific article; zbMATH DE number 7145382 (Why is no real title available?)
• On the coloring of signed graphs
• ON THE COMPLEXITY OF SOME COLORING GAMES
• Radius two trees specify χ‐bounded classes
• Refined activation strategy for the marking game
• Size of edge-critical uniquely 3-colorable planar graphs
• The difference between game chromatic number and chromatic number of graphs
• The game coloring number of planar graphs
• The Map-Coloring Game
• Uniquely colorable Cayley graphs
• Uniquely colorable graphs

Cited in

(1)

• Uniquely n-colorable and chromatically equivalent graphs

This page was built for publication: Uniquely colorable graphs with equal chromatic and game chromatic numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5866017)