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