  The chromatic number of signed graphs is defined recently. The coloring and
clique problem of interval graphs has been studied and polynomial time
algorithms are established. Here we consider these problems for signed interval
graphs and prove that the coloring problem of signed interval graphs is
NP-complete whereas their ordinary clique problem is in P. We also study the
complexity of further related problems.
