Pages that link to "Item:Q2027314"
From MaRDI portal
The following pages link to Cliques and constructors in ``Hats'' game. II (Q2027314):
Displaying 10 items.
- Cliques and constructors in ``Hats'' game. I (Q2027311) (← links)
- The Hats game. The power of constructors (Q2027322) (← links)
- The Hats game. On maximum degree and diameter (Q2138959) (← 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 Optimal Strategies for a Hat Game on Graphs (Q3008007) (← links)
- Strategic equivalence among hat puzzles of various protocols with many colors (Q6096322) (← links)
- Hat guessing number for the class of planar graphs is at least 22 (Q6177422) (← links)
- Bears with hats and independence polynomials (Q6599792) (← links)
- The hat guessing game on cactus graphs and cycles (Q6635115) (← links)