The following pages link to Colorings at minimum cost (Q960968):
Displaying 5 items.
- On the cost-chromatic number of graphs (Q1363702) (← links)
- Entropy and a certain cost-minimal coloring of graph vertices (Q2472782) (← links)
- On the cost chromatic number of outerplanar, planar, and line graphs (Q4210666) (← links)
- Paint cost and the frugal distinguishing number (Q5058214) (← links)
- Coloring fast without learning your neighbors' colors (Q6535038) (← links)