Pages that link to "Item:Q510358"
From MaRDI portal
The following pages link to The three colour hat guessing game on cycle graphs (Q510358):
Displaying 18 items.
- The three colour hat guessing game on cycle graphs (Q510358) (← links)
- The hat guessing number of graphs (Q777481) (← links)
- Cliques and constructors in ``Hats'' game. I (Q2027311) (← links)
- Cliques and constructors in ``Hats'' game. II (Q2027314) (← links)
- The Hats game. The power of constructors (Q2027322) (← links)
- Hat guessing on books and windmills (Q2073305) (← links)
- On the hat guessing number of graphs (Q2075532) (← links)
- Hat problem: a new strategy based on quantum stabilizer codes (Q2107049) (← links)
- The Hats game. On maximum degree and diameter (Q2138959) (← links)
- Hat guessing numbers of degenerate graphs (Q2200434) (← links)
- Hat chromatic number of graphs (Q2231730) (← links)
- On the stability and instability of finite dynamical systems with prescribed interaction graphs (Q2318780) (← links)
- For which graphs the sages can guess correctly the color of at least one hat (Q2632547) (← links)
- Bears with hats and independence polynomials (Q2672444) (← links)
- On the hat guessing number of a planar graph class (Q2673483) (← links)
- Finite Dynamical Systems, Hat Games, and Coding Theory (Q4578011) (← links)
- Hat Guessing Numbers of Strongly Degenerate Graphs (Q6161264) (← links)
- Hat guessing number for the class of planar graphs is at least 22 (Q6177422) (← links)
