Cliques and constructors in ``Hats game. II

DOI10.1007/s10958-021-05349-8zbMath1466.91056OpenAlexW4239182639MaRDI QIDQ2027314

K. P. Kokhas', V. I. Retinskiy, A. S. Latyshev

Publication date: 26 May 2021

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-021-05349-8

Mathematics Subject Classification ID

Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (3)

The Hats game. On maximum degree and diameter ⋮ Bears with hats and independence polynomials ⋮ Hat guessing number for the class of planar graphs is at least 22

Cites Work

• The three colour hat guessing game on cycle graphs
• The hat guessing number of graphs
• For which graphs the sages can guess correctly the color of at least one hat
• Finite Dynamical Systems, Hat Games, and Coding Theory
• New Constructions and Bounds for Winkler's Hat Game
• Hat Guessing Games

This page was built for publication: Cliques and constructors in ``Hats game. II