The following pages link to Tabular graphs and chromatic sum (Q2576829):
Displaying 7 items.
- Total colorings of graphs with minimum sum of colors (Q503645) (← links)
- Sum coloring and interval graphs: A tight upper bound for the minimum number of colors (Q1827686) (← links)
- Total chromatic sum for trees (Q2056882) (← links)
- New variable neighborhood search method for minimum sum coloring problem on simple graphs (Q3389565) (← links)
- Graphs that require many colors to achieve their chromatic sum (Q3483299) (← links)
- Tight bounds on the chromatic sum of a connected graph (Q3832591) (← links)
- (Q5037233) (← links)