Playing a game to bound the chromatic number

DOI10.4169/AMER.MATH.MONTHLY.119.09.771MaRDI QIDQ4923951zbMATH OpenOpenAlexWikidataFDO

Authors Panagiota N. Panagopoulou, P. G. Spirakis

Publication date 28 May 2013

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4169/amer.math.monthly.119.09.771

zbMATH Keywords

algorithmchromatic numbercoloring gamecomplexitygraph coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Computational methods for problems pertaining to game theory, economics, and finance (91-08) 2-person games (91A05) Noncooperative games (91A10) Games involving graphs (91A43) Applications of game theory (91A80)

Recommendations

• A Game Theoretic Approach for Efficient Graph Coloring
• Radius two trees specify χ‐bounded classes
• Strategic Coloring of a Graph
• The game coloring number of planar graphs
• scientific article; zbMATH DE number 398953

Cited in

(1)

• On the Nash number and the diminishing Grundy number of a graph

This page was built for publication: Playing a game to bound the chromatic number

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