Strategic Coloring of a Graph

DOI10.1007/978-3-642-13073-1_15zbMath1284.05168OpenAlexW1506905331MaRDI QIDQ3563000

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

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

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

Related Items (3)

On the Nash number and the diminishing Grundy number of a graph ⋮ Network Coloring and Colored Coin Games ⋮ Price of anarchy for graph coloring games with concave payoff

This page was built for publication: Strategic Coloring of a Graph