Minimum sum set coloring of trees and line graphs of trees
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...
Guardado en:
| Autores principales: | Bonomo, F., Durn, G., Marenco, J., Valencia-Pabon, M. |
|---|---|
| Formato: | Artículo publishedVersion |
| Publicado: |
2011
|
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_0166218X_v159_n5_p288_Bonomo https://repositoriouba.sisbi.uba.ar/gsdl/cgi-bin/library.cgi?a=d&c=artiaex&d=paper_0166218X_v159_n5_p288_Bonomo_oai |
| Aporte de: |
Ejemplares similares
-
Minimum sum set coloring of trees and line graphs of trees
por: Bonomo, F., et al.
Publicado: (2011) -
Minimum sum set coloring of trees and line graphs of trees
por: Bonomo, F., et al. -
Minimum sum set coloring of trees and line graphs of trees
por: Bonomo, Flavia, et al.
Publicado: (2011) -
On the Minimum Sum Coloring of P4-Sparse Graphs
por: Bonomo, F., et al. -
On the Minimum Sum Coloring of P 4-Sparse Graphs
por: Bonomo, F., et al.