Sum coloring of bipartite graphs with bounded degree

DOI10.1007/s00453-004-1111-4zbMath1084.05029OpenAlexW2095158197MaRDI QIDQ1884769

Krzysztof Giaro, Robert Janczewski, Michał Małafiejski, Marek Kubale

Publication date: 5 November 2004

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-004-1111-4

zbMATH Keywords

chromatic sum

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

On the performance guarantee of first fit for sum coloring ⋮ Approximate minimum sum colorings and maximum \(k\)-colorable subgraphs of chordal graphs ⋮ Scheduling of Identical Jobs with Bipartite Incompatibility Graphs on Uniform Machines. Computational Experiments ⋮ A note on the strength and minimum color sum of bipartite graphs

This page was built for publication: Sum coloring of bipartite graphs with bounded degree