Pages that link to "Item:Q1363702"
From MaRDI portal
The following pages link to On the cost-chromatic number of graphs (Q1363702):
Displaying 7 items.
- Cost colourings of hypergraphs (Q878618) (← links)
- Colorings at minimum cost (Q960968) (← links)
- ILP models and column generation for the minimum sum coloring problem (Q1742227) (← links)
- Sum coloring and interval graphs: A tight upper bound for the minimum number of colors (Q1827686) (← links)
- A branch-and-price algorithm for the minimum sum coloring problem (Q1983110) (← links)
- Minimum sum coloring problem: upper bounds for the chromatic strength (Q2410252) (← links)
- (Q2861511) (← links)
