The three colour hat guessing game on cycle graphs
From MaRDI portal
Publication:510358
zbMath1355.05172arXiv1412.3435MaRDI QIDQ510358
Publication date: 17 February 2017
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.3435
cooperative gamessystem reliabilitygraph colouringgames on graphsinformation networkdeterministic strategyhat guessing problemshat puzzle
Cooperative games (91A12) Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (18)
The Hats game. On maximum degree and diameter ⋮ For which graphs the sages can guess correctly the color of at least one hat ⋮ Finite Dynamical Systems, Hat Games, and Coding Theory ⋮ 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 numbers of degenerate graphs ⋮ Hat chromatic number of graphs ⋮ The three colour hat guessing game on cycle graphs ⋮ Cliques and constructors in ``Hats game. I ⋮ Cliques and constructors in ``Hats game. II ⋮ The Hats game. The power of constructors ⋮ On the stability and instability of finite dynamical systems with prescribed interaction graphs ⋮ Hat guessing on books and windmills ⋮ On the hat guessing number of graphs ⋮ The hat guessing number of graphs ⋮ Hat problem: a new strategy based on quantum stabilizer codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Guessing games on triangle-free graphs
- The three colour hat guessing game on cycle graphs
- The guessing number of undirected graphs
- On the guessing number of shift graphs
- Information flows, graphs and their guessing numbers
- On Optimal Strategies for a Hat Game on Graphs
- A New Variation of Hat Guessing Games
- Hat Guessing Games
This page was built for publication: The three colour hat guessing game on cycle graphs
