Strategic Coloring of a Graph
From MaRDI portal
Publication:4905096
DOI10.1080/15427951.2012.709217zbMATH Open1257.91009OpenAlexW2038913457MaRDI QIDQ4905096FDOQ4905096
Authors: Bruno Escoffier, Laurent Gourvès, Jérôme Monnot 
Publication date: 15 February 2013
Published in: Internet Mathematics (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.im/1354809992
Recommendations
- Strategic coloring of a graph
- Graph colorings
- The coloring of graphs
- scientific article; zbMATH DE number 3935075
- A Game Theoretic Approach for Efficient Graph Coloring
- Sur le coloriage des graphs
- Graph coloring satisfying restraints
- Color-induced graph colorings
- Color-induced graph colorings
- A new graph coloring scheme
Cited In (12)
- Coordination games on graphs
- Strategic coloring of a graph
- Anti-coordination games and stable graph colorings
- Network coloring and colored coin games
- How long does it take for all users in a social network to choose their communities?
- Generalized graph \(k\)-coloring games
- Generalized graph \(k\)-coloring games
- Playing a game to bound the chromatic number
- Non-existence of stable social groups in information-driven networks
- How long does it take for all users in a social network to choose their communities?
- Coordination games on weighted directed graphs
- Price of anarchy for graph coloring games with concave payoff
This page was built for publication: Strategic Coloring of a Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4905096)
