On the hat problem on a graph

DOI10.7494/OPMATH.2012.32.2.285MaRDI QIDQ2901951zbMATH OpenFDO

Authors Marcin Krzywkowski

Publication date 31 July 2012

Published in Opuscula Mathematica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7494/OPMATH.2012.32.2.285

zbMATH Keywords

degreegraphhat problemneighborhoodneighborhood-dominatednordhaus-gaddumunicyclicuniversal vertex

Mathematics Subject Classification ID

Vertex degrees (05C07) Paths and cycles (05C38) Graph theory (05C99) Cooperative games (91A12)

Recommendations

• The hat problem on cycles on at least nine vertices.
• On the hat problem on the cycle C₇
• scientific article; zbMATH DE number 5881230
• Hat problem on odd cycles
• The hat problem on a union of disjoint graphs

Cited in

(21)

• Hat problem on graphs with exactly three cycles
• Hat problem: a new strategy based on quantum stabilizer codes
• Hat guessing numbers of degenerate graphs
• Hat chromatic number of graphs
• On the stability and instability of finite dynamical systems with prescribed interaction graphs
• Bears with hats and independence polynomials
• The hat problem on cycles on at least nine vertices.
• A numbers-on-foreheads game
• scientific article; zbMATH DE number 5881230 (Why is no real title available?)
• On the hat problem on the cycle C₇
• On optimal strategies for a hat game on graphs
• Hat problem on odd cycles
• A modified hat problem
• A construction for the hat problem on a directed graph
• Finite dynamical systems, hat games, and coding theory
• Hat problem on bicyclic graphs
• On Levine’s notorious hat puzzle
• New constructions and bounds for Winkler's hat game
• The hat problem on a union of disjoint graphs
• The Success Probability in Levine’s Hat Problem, and Independent Sets in Graphs
• The hat guessing number of graphs

This page was built for publication: On the hat problem on a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2901951)