Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
JGT
2010
89views more  JGT 2010»
12 years 10 days ago
Non-rainbow colorings of 3-, 4- and 5-connected plane graphs
We study vertex-colorings of plane graphs that do not contain a rainbow face, i.e., a face with vertices of mutually distinct colors. If G is a 3-connected plane graph with n vert...
Zdenek Dvorak, Daniel Král', Riste Skrekovs...
ICCI
1991
12 years 5 months ago
On the k-Coloring of Intervals
The problem of coloring a set of n intervals (from the real line) with a set of k colors is studied. In such a coloring, two intersecting intervals must receive distinct colors. O...
Martin C. Carlisle, Errol L. Lloyd
ICALP
2010
Springer
12 years 6 months ago
Clustering with Diversity
Abstract. We consider the clustering with diversity problem: given a set of colored points in a metric space, partition them into clusters such that each cluster has at least point...
Jian Li, Ke Yi, Qin Zhang
WAOA
2004
Springer
141views Algorithms» more  WAOA 2004»
12 years 7 months ago
Strong Colorings of Hypergraphs
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...
Geir Agnarsson, Magnús M. Halldórsso...
books