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...

Повний опис

Бібліографічні деталі
Автори: Gerke, S, McDiarmid, C
Формат: Journal article
Мова:English
Опубліковано: 2004