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ó completa

Dades bibliogràfiques
Autors principals: Gerke, S, McDiarmid, C
Format: Journal article
Idioma:English
Publicat: 2004