Hat guessing number for the class of planar graphs is at least 22

DOI10.1016/j.disc.2023.113820zbMath1530.05127MaRDI QIDQ6177422

Konstantin Kokhas, Aleksei Latyshev

Publication date: 17 January 2024

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

zbMATH Keywords

perfect hash familyplanar graphdeterministic strategyhat guessing number

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43) Planar graphs; geometric and topological aspects of graph theory (05C10) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• The three colour hat guessing game on cycle graphs
• The hat guessing number of graphs
• New constructions for IPP codes
• Cliques and constructors in ``Hats game. I
• Cliques and constructors in ``Hats game. II
• The Hats game. The power of constructors
• Hat guessing on books and windmills
• On the hat guessing number of graphs
• The Hats game. On maximum degree and diameter
• Hat guessing numbers of degenerate graphs
• Hat chromatic number of graphs
• For which graphs the sages can guess correctly the color of at least one hat
• Bears with hats and independence polynomials
• On the hat guessing number of a planar graph class
• New Constructions and Bounds for Winkler's Hat Game
• Hat Guessing Games
• Hat Guessing Numbers of Strongly Degenerate Graphs

This page was built for publication: Hat guessing number for the class of planar graphs is at least 22