Pages that link to "Item:Q2149192"
From MaRDI portal
The following pages link to Minimum coloring problems with weakly perfect graphs (Q2149192):
Displaying 6 items.
- Simple and three-valued simple minimum coloring games (Q343804) (← links)
- Fair cost allocations under conflicts - a game-theoretic point of view - (Q924627) (← links)
- On the properties of weighted minimum colouring games (Q2095946) (← links)
- On the minimum load coloring problem (Q2466019) (← links)
- Minimal colorings for properly colored subgraphs (Q2563425) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710820) (← links)