Abstract
The problem to determine whether a given k-colored graph is a subgraph of
a properly k-colored interval graph is shown to be solvable in O(n) time when
k = 2, solvable in O(n2) time when k = 3, and to be NP-complete for any fixed
k ≥ 4. This problem has an application
... read more