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 |
---|---|
Format: | Journal article |
Language: | English |
Published: |
2004
|
Similar Items
-
Graph Imperfection.
by: Gerke, S, et al.
Published: (2001) -
Graph Imperfection II.
by: Gerke, S, et al.
Published: (2001) -
On the Number of Edges in Random Planar Graphs.
by: Gerke, S, et al.
Published: (2004) -
Random planar graphs with n nodes and a fixed number of edges.
by: Gerke, S, et al.
Published: (2005) -
Random graphs on surfaces.
by: McDiarmid, C
Published: (2008)