On the Minimum Sum Coloring of P 4-Sparse Graphs

@article{Bonomo2014OnTM,
  title={On the Minimum Sum Coloring of P 4-Sparse Graphs},
  author={Flavia Bonomo and Mario Valencia-Pabon},
  journal={Graphs and Combinatorics},
  year={2014},
  volume={30},
  pages={303-314}
}
In this paper, we study the Minimum Sum Coloring (MSC) problem on P4-sparse graphs. In the MSC problem, we aim to assign natural numbers to vertices of a graph such that adjacent vertices get different numbers, and the sum of the numbers assigned to the vertices is minimum. Based in the concept of maximal sequence associated with an optimal solution of the MSC problem of any graph, we show that there is a large sub-family of P4-sparse graphs for which the MSC problem can be solved in polynomial… CONTINUE READING

Similar Papers

Loading similar papers…