The following pages link to The hat guessing number of graphs (Q777481):
Displaying 22 items.
- Guessing games on triangle-free graphs (Q278884) (← links)
- On a conjecture of Butler and Graham (Q369429) (← links)
- A construction for the hat problem on a directed graph (Q426792) (← links)
- A note on marking lines in \([k]^n\) (Q690664) (← 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)
- Bears with hats and independence polynomials (Q2672444) (← links)
- On the hat guessing number of a planar graph class (Q2673483) (← links)
- (Q2995577) (← links)
- A New Variation of Hat Guessing Games (Q3087987) (← 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)
- Bears with hats and independence polynomials (Q6599792) (← links)
- The hat guessing game on cactus graphs and cycles (Q6635115) (← links)
