Pages that link to "Item:Q4572001"
From MaRDI portal
The following pages link to Approximation results for the optimum cost chromatic partition problem (Q4572001):
Displaying 6 items.
- Minimum sum set coloring of trees and line graphs of trees (Q628310) (← links)
- On the minimum sum coloring of \(P_4\)-sparse graphs (Q742570) (← links)
- Minimum sum edge colorings of multicycles (Q987666) (← links)
- On chromatic sums and distributed resource allocation (Q1383159) (← links)
- On coloring problems with local constraints (Q5891606) (← links)
- Exploring the complexity boundary between coloring and list-coloring (Q5896984) (← links)
