Hypergraph Coloring Games and Voter Models

DOI10.1007/978-3-642-30541-2_1MaRDI QIDQ2900580zbMATH OpenOpenAlexFDO

Authors Alexander Tsiatas, Fan Chung

Publication date 23 July 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-30541-2_1

zbMATH Keywords

memoryless gamenetwork coloring game on hypergraphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Games on graphs (graph-theoretic aspects) (05C57) Hypergraphs (05C65) Random walks on graphs (05C81) Games involving graphs (91A43) Voting theory (91B12)

Recommendations

• Hypergraph Coloring Games and Voter Models
• scientific article; zbMATH DE number 4200245
• Generalised game colouring of graphs
• Colouring game and generalized colouring game on graphs with cut-vertices
• Generalized graph \(k\)-coloring games
• Generalized graph \(k\)-coloring games
• The complexity of coloring games on perfect graphs
• Colorings of hypergraphs
• Hypergraph colouring

Cited in

(5)

• A MODEL OF GRAPH COLORING DYNAMICS WITH ATTENTION WAVES AND STRATEGIC WAITING
• Reachability and recurrence in a modular generalization of annihilating random walks (and Lights-Out games) to hypergraphs
• Voter model on signed social networks
• Hypergraph Coloring Games and Voter Models
• Mixing times for exclusion processes on hypergraphs

This page was built for publication: Hypergraph Coloring Games and Voter Models

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