Strategic coloring of a graph

DOI10.1007/978-3-642-13073-1_15MaRDI QIDQ3563000zbMATH OpenOpenAlexFDO

Authors Bruno Escoffier, Laurent Gourvès, Jérôme Monnot

Publication date 28 May 2010

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

Full work available at URL https://basepub.dauphine.fr/handle/123456789/4512

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)

Recommendations

• Strategic Coloring of a Graph
• A Game Theoretic Approach for Efficient Graph Coloring
• Generalized graph k-coloring games
• Generalized graph \(k\)-coloring games
• Price of anarchy for graph coloring games with concave payoff

Cited in

(7)

• On the Nash number and the diminishing Grundy number of a graph
• Anti-coordination games and stable graph colorings
• Network coloring and colored coin games
• Strategic Coloring of a Graph
• Price of anarchy for graph coloring games with concave payoff
• Generalized graph \(k\)-coloring games
• Generalized graph k-coloring games

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 Q3563000)