The following pages link to On sum coloring of graphs (Q1811069):
Displaying 21 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)
- Max-optimal and sum-optimal labelings of graphs (Q763483) (← links)
- The transportation problem with conflicts (Q829180) (← links)
- Minimum sum edge colorings of multicycles (Q987666) (← links)
- Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems (Q1026761) (← links)
- Complexity results for minimum sum edge coloring (Q1028432) (← links)
- Hybrid evolutionary search for the minimum sum coloring problem of graphs (Q1615675) (← links)
- On the performance guarantee of first fit for sum coloring (Q1628787) (← links)
- ILP models and column generation for the minimum sum coloring problem (Q1742227) (← links)
- An effective heuristic algorithm for sum coloring of graphs (Q1762148) (← links)
- On sum coloring of graphs (Q1811069) (← links)
- A branch-and-price algorithm for the minimum sum coloring problem (Q1983110) (← links)
- Computing lower bounds for minimum sum coloring and optimum cost chromatic partition (Q2003584) (← links)
- Minimum sum coloring problem: upper bounds for the chromatic strength (Q2410252) (← links)
- On sum edge-coloring of regular, bipartite and split graphs (Q2448910) (← links)
- Minimum sum multicoloring on the edges of trees (Q2503344) (← links)
- Minimum Sum Coloring of P4-sparse graphs (Q2840552) (← links)
- Lower Bounds for the Minimal Sum Coloring Problem (Q2883634) (← links)
- Chromatic Edge Strength of Some Multigraphs (Q3503528) (← links)
- A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph (Q5445753) (← links)
