On the cost-chromatic number of graphs

DOI10.1016/S0012-365X(96)00005-2zbMath0876.05031OpenAlexW2078054726MaRDI QIDQ1363702

John Mitchem, Patrick Morriss

Publication date: 10 August 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00005-2

zbMATH Keywords

vertex colouringscost-chromatic number

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items

Cost colourings of hypergraphs ⋮ Minimum sum coloring problem: upper bounds for the chromatic strength ⋮ A branch-and-price algorithm for the minimum sum coloring problem ⋮ ILP models and column generation for the minimum sum coloring problem ⋮ Colorings at minimum cost ⋮ Unnamed Item ⋮ Sum coloring and interval graphs: A tight upper bound for the minimum number of colors

Cites Work

• On the sum coloring problem on interval graphs
• Tight bounds on the chromatic sum of a connected graph
• Unnamed Item