Pages that link to "Item:Q967294"
From MaRDI portal
The following pages link to A note on the strength and minimum color sum of bipartite graphs (Q967294):
Displayed 3 items.
- Computing lower bounds for minimum sum coloring and optimum cost chromatic partition (Q2003584) (← links)
- A note on polynomial algorithm for cost coloring of bipartite graphs with \(\Delta \leq 4\) (Q2175244) (← links)
- Scheduling of Identical Jobs with Bipartite Incompatibility Graphs on Uniform Machines. Computational Experiments (Q5162169) (← links)