The guessing number of undirected graphs
zbMATH Open1337.05077MaRDI QIDQ640453FDOQ640453
Authors: Demetres Christofides, Klas Markström 
Publication date: 18 October 2011
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.emis.de/journals/EJC/Volume_18/Abstracts/v18i1p192.html
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- The linear guessing number of undirected graphs
- Guessing numbers and extremal graph theory
- On the guessing number of shift graphs
- Hat guessing numbers of degenerate graphs
- Hat Guessing Numbers of Strongly Degenerate Graphs
- The number of matchings in random graphs
- On the matching number of an uncertain graph
- Ulam numbers of graphs
- The number of graphs and a random graph with a given degree sequence
- On the hat guessing number of a planar graph class
Graph theory (including graph drawing) in computer science (68R10) Games on graphs (graph-theoretic aspects) (05C57) Fractional graph theory, fuzzy graph theory (05C72) Theory of error-correcting codes and error-detecting codes (94B99) Network protocols (68M12)
Cited In (9)
- Guessing numbers and extremal graph theory
- Guessing games on triangle-free graphs
- The linear guessing number of undirected graphs
- Finite Dynamical Systems, Hat Games, and Coding Theory
- Construction of storage codes of rate approaching one on triangle-free graphs
- On the influence of the interaction graph on a finite dynamical system
- The three colour hat guessing game on cycle graphs
- Guessing numbers of odd cycles
- On the guessing number of shift graphs
This page was built for publication: The guessing number of undirected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q640453)
