The chromatic sum of a graph: history and recent developments
From MaRDI portal
Publication:1774775
DOI10.1155/S0161171204306216zbMath1064.05062WikidataQ105816001 ScholiaQ105816001MaRDI QIDQ1774775
Publication date: 18 May 2005
Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/51336
Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)
Related Items (24)
On the performance guarantee of first fit for sum coloring ⋮ On certain coloring parameters of Mycielski graphs of some graphs ⋮ A note on polynomial algorithm for cost coloring of bipartite graphs with \(\Delta \leq 4\) ⋮ On chromatic sums and distributed resource allocation ⋮ New variable neighborhood search method for minimum sum coloring problem on simple graphs ⋮ Multicoloring trees. ⋮ Minimum sum set coloring of trees and line graphs of trees ⋮ Online sum-paintability: the slow-coloring game ⋮ Batch Coloring of Graphs ⋮ On sum edge-coloring of regular, bipartite and split graphs ⋮ Total colorings of graphs with minimum sum of colors ⋮ Batch coloring of graphs ⋮ A note on the strength and minimum color sum of bipartite graphs ⋮ Unnamed Item ⋮ A short proof of the NP-completeness of minimum sum interval coloring ⋮ Unnamed Item ⋮ A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph ⋮ Certain chromatic sums of some cycle-related graph classes ⋮ A study on the injective coloring parameters of certain graphs ⋮ Complexity results for minimum sum edge coloring ⋮ Sum coloring and interval graphs: A tight upper bound for the minimum number of colors ⋮ New parameters involving chromatic sum in a graph ⋮ Minimum Sum Coloring of P4-sparse graphs ⋮ Tabular graphs and chromatic sum
This page was built for publication: The chromatic sum of a graph: history and recent developments
