Hat guessing number for the class of planar graphs is at least 22
From MaRDI portal
(Redirected from Hat guessing number for the class of planar graphs is at least 22)
Recommendations
Cites work
- Bears with hats and independence polynomials
- Cliques and constructors in ``Hats game. I
- Cliques and constructors in ``Hats game. II
- For which graphs the sages can guess correctly the color of at least one hat
- Hat chromatic number of graphs
- Hat Guessing Games
- Hat guessing numbers of degenerate graphs
- Hat Guessing Numbers of Strongly Degenerate Graphs
- Hat guessing on books and windmills
- New constructions and bounds for Winkler's hat game
- New constructions for IPP codes
- On the hat guessing number of a planar graph class
- On the hat guessing number of graphs
- The hat guessing number of graphs
- The Hats game. On maximum degree and diameter
- The Hats game. The power of constructors
- The three colour hat guessing game on cycle graphs
Cited in
(3)
This page was built for publication: Hat guessing number for the class of planar graphs is at least 22
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6177422)