The guessing number of undirected graphs

MaRDI QIDQ640453zbMATH OpenFDO

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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

protocols for network coding

Mathematics Subject Classification ID

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)

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

Cited in

(9)

• Guessing games on triangle-free graphs
• On the guessing number of shift graphs
• Guessing numbers and extremal graph theory
• The linear guessing number of undirected graphs
• Finite dynamical systems, hat games, and coding theory
• Guessing numbers of odd cycles
• On the influence of the interaction graph on a finite dynamical system
• The three colour hat guessing game on cycle graphs
• Construction of storage codes of rate approaching one on triangle-free 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)