Minimum sum set coloring of trees and line graphs of trees

Mostrar todas las versiones(3)

In this paper, we study the minimum sum set coloring (MSSC) problem which consists in assigning a set of x(v) positive integers to each vertex v of a graph so that the intersection of sets assigned to adjacent vertices is empty and the sum of the assigned set of numbers to each vertex of the graph i...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Bonomo, F., Durn, G., Marenco, J., Valencia-Pabon, M.
Formato: JOUR
Materias:
Graph coloring
Line graphs of trees
Minimum sum coloring
Set-coloring
Trees
Graph colorings
Line graph
Coloring
Graph theory
Graphic methods
Trees (mathematics)
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_0166218X_v159_n5_p288_Bonomo
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares