Pages that link to "Item:Q2410252"
From MaRDI portal
The following pages link to Minimum sum coloring problem: upper bounds for the chromatic strength (Q2410252):
Displaying 9 items.
- Hybrid evolutionary search for the minimum sum coloring problem of graphs (Q1615675) (← links)
- The chromatic sum of a graph: history and recent developments (Q1774775) (← links)
- Sum coloring and interval graphs: A tight upper bound for the minimum number of colors (Q1827686) (← links)
- Computing lower bounds for minimum sum coloring and optimum cost chromatic partition (Q2003584) (← links)
- Contrast in greyscales of graphs (Q2307508) (← links)
- Minimum sum coloring problem: upper bounds for the chromatic strength (Q2410252) (← links)
- A short proof of the NP-completeness of minimum sum interval coloring (Q2488233) (← links)
- Lower bounds for the minimal sum coloring problem (Q2883634) (← links)
- Minimum gradation in greyscales of graphs (Q6108924) (← links)