Simple and three-valued simple minimum coloring games
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
- Core Stability of Minimum Coloring Games
- Fair cost allocations under conflicts - a game-theoretic point of view -
- Monotonic stable solutions for minimum coloring games
- Operations research games: A survey. (With comments and rejoinder)
- Step out-step in sequencing games
- Submodularity of some classes of the combinatorial optimization games
- The strong perfect graph theorem
- Totally balanced combinatorial optimization games
- Vertex colouring and forbidden subgraphs -- a survey
Cited in
(7)- On the properties of weighted minimum colouring games
- scientific article; zbMATH DE number 5128851 (Why is no real title available?)
- Graph-Theoretic Concepts in Computer Science
- Algorithms and Computation
- Core Stability of Minimum Coloring Games
- Three-valued simple games
- Minimum coloring problems with weakly perfect graphs
This page was built for publication: Simple and three-valued simple minimum coloring games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q343804)