244 search results - page 1 / 49 » Intervalizing k-Colored Graphs |
162
Voted
ICALP
1995
Springer
15 years 3 months ago
1995
Springer
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...
131
click to vote
ICCI
1991
15 years 3 months ago
1991
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...
DAM
2007
15 years 6 days ago
2007
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 ...
110
Voted
MST
2010
14 years 10 months ago
2010
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
130
Voted
ALGORITHMICA
2010
14 years 10 months ago
2010
The problem of computing the chromatic number of a P5-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show tha...