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

DOI10.1016/J.DISC.2023.113820MaRDI QIDQ6177422zbMATH OpenFDO

Authors Aleksei Latyshev, Konstantin Kokhas

Publication date 17 January 2024

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2023.113820

zbMATH Keywords

deterministic strategyhat guessing numberperfect hash familyplanar graph

Mathematics Subject Classification ID

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

Recommendations

• The Hats game. The power of constructors
• The Hats game. On maximum degree and diameter
• On the hat guessing number of graphs
• Cliques and constructors in ``Hats game. II
• For which graphs the sages can guess correctly the color of at least one hat

Cites work

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

Cited in

(3)

• Bears with hats and independence polynomials
• The hat guessing game on cactus graphs and cycles
• Prisoners in a line transmitting (binary+ ) bits of information

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

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