Minimum coloring problems with weakly perfect graphs (Q2149192)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimum coloring problems with weakly perfect graphs |
scientific article; zbMATH DE number 7549718
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum coloring problems with weakly perfect graphs |
scientific article; zbMATH DE number 7549718 |
Statements
Minimum coloring problems with weakly perfect graphs (English)
0 references
28 June 2022
0 references
minimum coloring game
0 references
cost sharing
0 references
merge-proofness
0 references
unanimity lower bound
0 references
0.8459591269493103
0 references
0.8435945510864258
0 references
0.8422307372093201
0 references
0.8331992626190186
0 references
0.8171544075012207
0 references
