Flavia Bonomo-Braberman

On the Minimum Sum Coloring of P 4-Sparse Graphs

2014, Graphs and Combinatorics 30, 303-314, 2014
Citas: 14
Agregar PDF Importar citas Importar citas SCRAPME Plots Conexiones

Autor(es)

Flavia Bonomo and Mario Valencia-Pabon

URL Pública

https://link.springer.com/article/10.1007/s00373-012-1269-5

Abstract

In this paper, we study the minimum sum coloring (MSC) problem on P 4-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 P 4-sparse graphs for which the MSC problem can be solved in polynomial time. Moreover, we give a parameterized algorithm and a 2-approximation algorithm for the MSC problem on general P 4-sparse graphs.

Plot de citas