Between coloring and list-coloring: μ-coloring

A new variation of the coloring problem, μ-coloring, is defined in this paper. A coloring of a graph G = (V,E) is a function f: V → ℕ such that f(v) ≠ f(w) if v is adjacent to w. Given a graph G = (V, E) and a function μ: V → ℕ, G is μ-colorable if it admits a coloring f with f(v) ≤ μ(v) for each v...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Bonomo, Flavia
Publicado: 2011
Materias:
μ-coloring
Cographs
Coloring
List-coloring
M-perfect graphs
Perfect graphs
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03817032_v99_n_p383_Bonomo
http://hdl.handle.net/20.500.12110/paper_03817032_v99_n_p383_Bonomo
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares