Pages that link to "Item:Q742570"
From MaRDI portal
The following pages link to On the minimum sum coloring of \(P_4\)-sparse graphs (Q742570):
Displaying 6 items.
- Minimum sum set coloring of trees and line graphs of trees (Q628310) (← links)
- Minimal separators in \(P_4\)-sparse graphs (Q819831) (← links)
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (Q2172401) (← 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)
- Minimum sum coloring of \(P_{4}\)-sparse graphs (Q2840552) (← links)
