The following pages link to (Q4411283):
Displaying 19 items.
- Minimum sum set coloring of trees and line graphs of trees (Q628310) (← links)
- Probabilistic graph-coloring in bipartite and split graphs (Q732320) (← links)
- On the minimum sum coloring of \(P_4\)-sparse graphs (Q742570) (← links)
- On sum coloring and sum multi-coloring for restricted families of graphs (Q764335) (← links)
- A note on the strength and minimum color sum of bipartite graphs (Q967294) (← links)
- Minimum sum edge colorings of multicycles (Q987666) (← links)
- Complexity results for minimum sum edge coloring (Q1028432) (← links)
- Weighted coloring on planar, bipartite and split graphs: Complexity and approximation (Q1028481) (← links)
- A matched approximation bound for the sum of a greedy coloring (Q1606980) (← links)
- Comparison of sum choice number with chromatic sum (Q2032707) (← links)
- A note on polynomial algorithm for cost coloring of bipartite graphs with \(\Delta \leq 4\) (Q2175244) (← links)
- On sum edge-coloring of regular, bipartite and split graphs (Q2448910) (← links)
- Minimum sum coloring of \(P_{4}\)-sparse graphs (Q2840552) (← links)
- Chromatic Edge Strength of Some Multigraphs (Q3503528) (← links)
- Minimum Color Sum of Bipartite Graphs (Q4209269) (← links)
- Approximation Results for the Optimum Cost Chromatic Partition Problem (Q4943070) (← links)
- (Q5091252) (← links)
- Algorithms and Computation (Q5712175) (← links)
- Algorithms - ESA 2003 (Q5897262) (← links)
