1 paper
Sam Adriaensen, Peter Bentley, Anurag Bishnoi +6
We initiate the study of the hat guessing number of a graph where the adversary is only allowed to provide a proper coloring of the graph. This is the largest number q for which…