Hat guessing number for the class of planar graphs is at least 22
A Latyshev, K Kokhas - Discrete Mathematics, 2024 - Elsevier
We analyze the following version of the deterministic Hats game. We have a graph G, and a
sage resides at each vertex of G. When the game starts, an adversary puts on the head of …
sage resides at each vertex of G. When the game starts, an adversary puts on the head of …
[HTML][HTML] The hat guessing game on cactus graphs and cycles
J Chizewer, IMJ McInnis, M Sohrabi, S Kaistha - Discrete Mathematics, 2025 - Elsevier
We study the hat guessing game on graphs. In this game, a player is placed on each vertex
v of a graph G and assigned a colored hat from h (v) possible colors. Each player makes a …
v of a graph G and assigned a colored hat from h (v) possible colors. Each player makes a …
Analytic Methods and Combinatorial Plants
J Chizewer - 2024 - uwspace.uwaterloo.ca
Combinatorial structures have broad applications in computer science, from error-correcting
codes to matrix multiplication. Many analytic tools have been developed for studying these …
codes to matrix multiplication. Many analytic tools have been developed for studying these …
The Hat Guessing Number of Cactus Graphs and Cycles
J Chizewer, IMJ McInnis, M Sohrabi… - arXiv preprint arXiv …, 2023 - arxiv.org
We study the hat guessing game on graphs. In this game, a player is placed on each vertex
$ v $ of a graph $ G $ and assigned a colored hat from $ h (v) $ possible colors. Each player …
$ v $ of a graph $ G $ and assigned a colored hat from $ h (v) $ possible colors. Each player …