Bears with hats and independence polynomials
From MaRDI portal
Publication:6599792
DOI10.46298/DMTCS.10802zbMATH Open1546.05099MaRDI QIDQ6599792FDOQ6599792
Authors: Václav Blažej, Pavel Dvořák, Michal Opler 
Publication date: 6 September 2024
Published in: Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)
Graph polynomials (05C31) Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)
Cites Work
- The NP-Completeness of Edge-Coloring
- Title not available (Why is that?)
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Clique polynomials and independent set polynomials of graphs
- Information flows, graphs and their guessing numbers
- Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications
- Title not available (Why is that?)
- Hat Guessing Games
- On a problem of Spencer
- On Dependency Graphs and the Lattice Gas
- Derandomization of auctions
- On the guessing number of shift graphs
- The three colour hat guessing game on cycle graphs
- Hat guessing numbers of degenerate graphs
- On the Autoreducibility of Random Sequences
- Finite Dynamical Systems, Hat Games, and Coding Theory
- New Constructions and Bounds for Winkler's Hat Game
- The hat guessing number of graphs
- Cliques and constructors in ``Hats game. I
- Cliques and constructors in ``Hats game. II
- Hat chromatic number of graphs
- Bears with hats and independence polynomials
- The lefthanded local lemma characterizes chordal dependency graphs
This page was built for publication: Bears with hats and independence polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6599792)
