Hat chromatic number of graphs

DOI10.1016/j.disc.2021.112620zbMath1473.05202arXiv1905.04108OpenAlexW3198971151MaRDI QIDQ2231730

Przemysław Mazur, Michał Farnik, Andrzej Dudek, Jarosław Grytczuk, Bartłomiej Bosek

Publication date: 30 September 2021

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

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

zbMATH Keywords

graph coloringhat chromatic number

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (6)

Bears with hats and independence polynomials ⋮ On the hat guessing number of a planar graph class ⋮ Hat Guessing Numbers of Strongly Degenerate Graphs ⋮ Hat guessing number for the class of planar graphs is at least 22 ⋮ Hat guessing on books and windmills ⋮ On the hat guessing number of graphs

Cites Work

• The three colour hat guessing game on cycle graphs
• The hat guessing number of graphs
• Coloring with no 2-colored \(P_4\)'s
• Cliques and constructors in ``Hats game. I
• The Hats game. The power of constructors
• Hat guessing numbers of degenerate graphs
• For which graphs the sages can guess correctly the color of at least one hat
• Bears with hats and independence polynomials
• Graph Theory and Probability
• Hat Guessing Games
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hat chromatic number of graphs