Pages that link to "Item:Q4572001"

The following pages link to Approximation results for the optimum cost chromatic partition problem (Q4572001):

Displaying 20 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)
• Minimum sum edge colorings of multicycles (Q987666) (← links)
• Precoloring extension of co-Meyniel graphs (Q995757) (← links)
• On chromatic sums and distributed resource allocation (Q1383159) (← links)
• Sum coloring and interval graphs: A tight upper bound for the minimum number of colors (Q1827686) (← links)
• A note on polynomial algorithm for cost coloring of bipartite graphs with \(\Delta \leq 4\) (Q2175244) (← 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)
• The \(d\)-precoloring problem for \(k\)-degenerate graphs (Q2370443) (← links)
• Minimum sum coloring problem: upper bounds for the chromatic strength (Q2410252) (← links)
• Minimum sum multicoloring on the edges of trees (Q2503344) (← links)
• Hard coloring problems in low degree planar bipartite graphs (Q2506359) (← links)
• Integer programming in parameterized complexity: five miniatures (Q2673236) (← links)
• Minimum Sum Coloring of P4-sparse graphs (Q2840552) (← links)
• Approximation results for the optimum cost chromatic partition problem (Q4572001) (← links)
• Integer Programming in Parameterized Complexity: Three Miniatures. (Q5009484) (← links)
• On coloring problems with local constraints (Q5891093) (← links)
• On coloring problems with local constraints (Q5891606) (← links)
• Exploring the complexity boundary between coloring and list-coloring (Q5896984) (← links)
• \(b\)-coloring parameterized by clique-width (Q6614620) (← links)