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

全面介绍

书目详细资料
Main Authors: Gerke, S, McDiarmid, C
格式: Journal article
语言:English
出版: 2004