Tight bounds on the chromatic sum of a connected graph

DOI10.1002/jgt.3190130310zbMath0677.05028DBLPjournals/jgt/ThomassenEAMS89OpenAlexW2083692180WikidataQ34692312 ScholiaQ34692312MaRDI QIDQ3832591

Paresh J. Malde, Carsten Thomassen, Yousef Alavi, Allen J. Schwenk

Publication date: 1989

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190130310

zbMATH Keywords

chromatic sumproper colourings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (15)

On the cost-chromatic number of graphs ⋮ The color cost of a caterpillar ⋮ Cost colourings of hypergraphs ⋮ Minimum sum coloring problem: upper bounds for the chromatic strength ⋮ New variable neighborhood search method for minimum sum coloring problem on simple graphs ⋮ A new ant colony optimization algorithm for the lower bound of sum coloring problem ⋮ On the equality of the partial Grundy and upper ochromatic numbers of graphs ⋮ Contractions and minimal k-colorability ⋮ On sum edge-coloring of regular, bipartite and split graphs ⋮ A branch-and-price algorithm for the minimum sum coloring problem ⋮ ILP models and column generation for the minimum sum coloring problem ⋮ Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem ⋮ Unnamed Item ⋮ On sum coloring of graphs ⋮ Tabular graphs and chromatic sum

This page was built for publication: Tight bounds on the chromatic sum of a connected graph