On sum coloring of graphs
type: Item
instance of: scholarly article
title: On sum coloring of graphs
zbMATH Open document ID: 1018.05035
DOI: 10.1016/S0166-218X(02)00249-4
author: Mohammad Salavatipour
published in: Discrete Applied Mathematics
publication date: 2003-06-10T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1925252
zbMATH Keywords: chromatic sum
zbMATH Keywords: optimaum cost chromatic partition
zbMATH Keywords: NP-complete
zbMATH Keywords: vertex strength
zbMATH Keywords: edge sum coloring
zbMATH Keywords: edge strength
zbMATH Keywords: optimum coloring
zbMATH Keywords: polynomial time algorithm
MaRDI profile type: Publication
cites work: On chromatic sums and distributed resource allocation
cites work: Minimum Color Sum of Bipartite Graphs
cites work: Q3483299
cites work: An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs
cites work: Q4198056
cites work: Minimal coloring and strength of graphs
cites work: The NP-Completeness of Edge-Coloring
cites work: Q4395326
cites work: NP completeness of finding the chromatic index of regular graphs
cites work: Tight bounds on the chromatic sum of a connected graph
cites work: Computing the Minimum Fill-In is NP-Complete
cites work: Node-Deletion Problems on Bipartite Graphs
description: scientific article; zbMATH DE number 1925252