We consider the following kind of graph coloring, called sum coloring: for a given graph G, find a proper vertex coloring of G, using natural numbers, such that the total sum of the colors of vertices is minimized amongst all proper colorings of G.
May 1, 2003
In graph theory, a sum coloring of a graph is a labeling of its vertices by positive integers, with no two adjacent vertices having equal labels, ...
Abstract (summary): The sum coloring problem asks to find a vertex coloring of a given graph ' G', using natural numbers, such that the total sum of the ...
People also ask
What is the rule for graph coloring?
What is the minimum sum coloring problem?
What is the total coloring of planar graphs?
What is a complete coloring in graph theory?
The sum coloring problem asks to find a vertex coloring of a given graph G, using natural numbers, such that the total sum of the colors is minimized.
Sum coloring problem consists on minimizing the sum of colors used to color a graph where colors are represented by naturel numbers (1, 2,. . ., k). In this ...
An effective heuristic algorithm for sum coloring of graphs · Computer Science, Mathematics. Comput. Oper. Res. · 2012.
In this paper, we consider the sum coloring and sum multi-coloring problem for restricted families of graphs with respect to both hardness and approximation.
The sum coloring problem asks to find a vertex coloring of a given graph G, using natural numbers, such that the total sum of the colors is minimized.
The paper proves that a parallel metaheuristic like the parallel genetic algorithm (PGA) can be efficiently used for computing approximate sum colorings and ...
An odd coloring of a graph G is a proper coloring such that for every non-isolated vertex v ∈ V (G) at least one color c occurs an odd number of times on N(v).