Graph Imperfection with a Co-Site Constraint.

We are interested in a version of graph coloring where there is a "co-site" constraint value k. Given a graph G with a nonnegative integral demand x v at each node v, we must assign x v positive integers (colors) to each node v such that th...

Descripción completa

Detalles Bibliográficos
Autores principales: Gerke, S, McDiarmid, C
Formato: Journal article
Lenguaje:English
Publicado: 2004