Sciweavers

Share
4 search results - page 1 / 1
» On the k-Coloring of Intervals
Sort
View
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
1995
Springer
12 years 5 months ago
Intervalizing k-Colored Graphs
The problem to determine whether a given k-colored graph is a subgraph of a properly colored interval graph has an application in DNA physical mapping. In this paper, we study the...
Hans L. Bodlaender, Babette de Fluiter
DAM
2007
94views more  DAM 2007»
12 years 1 months ago
The harmonious coloring problem is NP-complete for interval and permutation graphs
In this paper, we prove that the harmonious coloring problem is NP-complete for connected interval and permutation graphs. Given a simple graph G, a harmonious coloring of G is a ...
Katerina Asdre, Kyriaki Ioannidou, Stavros D. Niko...
CORR
2010
Springer
116views Education» more  CORR 2010»
11 years 11 months ago
Balanced Interval Coloring
We consider the discrepancy problem of coloring n intervals with k colors such that at each point on the line, the maximal difference between the number of intervals of any two co...
Antonios Antoniadis, Falk Hüffner, Pascal Len...
books