Weakly transitive orientations, Hasse diagrams and string graphs

AbstractWe introduce the notion of a weakly transitive orientation for graphs as a natural generalization of transitive orientations and give a characterization for weakly transitive orientations in terms of forbidden substructurs. As a corollary of this characterization, we get that the Hasse diagrams of posets are exactly the triangle-free weakly transitive oriented graphs. Moreover, we characterize the complements of weakly transitive orientable graphs as a special class of intersection graphs of paths in planar graphs. In this way, complements of weakly transitive orientable graphs prove to form a common generalization of several known classes of intersection graphs such as circular-permutation graphs (and, thus, circular-arc graphs), complements of comparability graphs (and, thus, permutation graphs and interval graphs). An immediate consequence of this theorem is an intersection graph characterization of Hasse diagrams. Using this characterization, we obtain a simple reduction of the problem to decide for a graph whether it admits an orientation as a Hasse diagram to the recognition problem for string graphs. Using a result of Nešetřil and Rödl that Hasse diagram orientation is NP-complete, this gives a new proof for NP-hardness of the string graph recognition problem. The status of complexity of the recognition problem for string graphs (intersection graphs of curves in the plane) was a long-standing open problem until Kratochvil gave a (rather involved) NP-hardness proof in 1988