On the Minimum Sum Coloring of P 4-Sparse Graphs

Mostrar todas las versiones(2)

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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Bonomo, F., Valencia-Pabon, M.
Formato: INPR
Lenguaje:English
Materias:
Graph coloring
Minimum sum coloring
P 4-sparse graphs
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_09110119_v_n_p1_Bonomo
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares