Coloring and Recognizing Directed Interval Graphs

A mixed interval graph is an interval graph that has, for every pair of intersecting intervals, either an arc (directed arbitrarily) or an (undirected) edge. We are interested in mixed interval graphs where the type of connection of two vertices is determined by geometry. In a proper coloring of a mixed interval graph G, an interval u receives a lower (different) color than an interval v if G contains arc (u, v) (edge {u, v}). We introduce a new natural class of mixed interval graphs, which we call containment interval graphs. In such a graph, there is an arc (u, v) if interval u contains interval v, and there is an edge {u, v} if u and v overlap. We show that these graphs can be recognized in polynomial time, that coloring them with the minimum number of colors is NP-hard, and that there is a 2-approximation algorithm for coloring. For coloring general mixed interval graphs, we present a min{{\omega}(G), {\lambda}(G)}-approximation algorithm, where {\omega}(G) is the size of a largest clique and {\lambda}(G) is the length of a longest induced directed path in G. For the subclass of bidirectional interval graphs (introduced recently), we show that optimal coloring is NP-hard.