Pages that link to "Item:Q2840552"
From MaRDI portal
The following pages link to Minimum Sum Coloring of P4-sparse graphs (Q2840552):
Displayed 5 items.
- On the minimum sum coloring of \(P_4\)-sparse graphs (Q742570) (← links)
- Computing lower bounds for minimum sum coloring and optimum cost chromatic partition (Q2003584) (← links)
- A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to \(P_4\)-sparse graphs (Q2345859) (← links)
- Minimum sum coloring problem: upper bounds for the chromatic strength (Q2410252) (← links)
- The packing coloring problem for lobsters and partner limited graphs (Q2448872) (← links)