Simple and three-valued simple minimum coloring games
From MaRDI portal
Publication:343804
DOI10.1007/s00186-016-0542-4zbMath1371.91025OpenAlexW2258430235WikidataQ59460132 ScholiaQ59460132MaRDI QIDQ343804
P. E. M. Borm, Marieke Musegaas, Marieke Quant
Publication date: 29 November 2016
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-016-0542-4
Cooperative games (91A12) Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57)
Related Items
Cites Work
- Unnamed Item
- Step out-step in sequencing games
- The strong perfect graph theorem
- Fair cost allocations under conflicts - a game-theoretic point of view -
- Operations research games: A survey. (With comments and rejoinder)
- Submodularity of some classes of the combinatorial optimization games
- Totally balanced combinatorial optimization games
- Vertex colouring and forbidden subgraphs -- a survey
- Monotonic stable solutions for minimum coloring games
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
- Core Stability of Minimum Coloring Games
This page was built for publication: Simple and three-valued simple minimum coloring games