Simple and three-valued simple coloring games

Marieke Musegaas, Peter Borm, Marieke Quant

Research output: Contribution to journalArticleScientificpeer-review

1 Citation (Scopus)


In this paper minimum coloring games are considered. We characterize the class of conflict graphs inducing simple or three-valued simple minimum coloring games. We provide an upper bound on the number of maximum cliques of conflict graphs inducing such games. Moreover, a characterization of the core is provided in terms of the underlying conflict graph. In particular, in case of a perfect conflict graph the core of an induced three-valued simple minimum coloring game equals the vital core.
Original languageEnglish
Pages (from-to)239-258
Number of pages20
JournalMathematical Methods of Operations Research
Issue number2
Publication statusPublished - Oct 2016


  • minimum coloring games
  • simple games
  • three-valued simple games


Dive into the research topics of 'Simple and three-valued simple coloring games'. Together they form a unique fingerprint.

Cite this