A characterization of P4P4-comparability graphs

A graph is a P4P4-comparability graph if it admits an acyclic orientation of its edges which is transitive on every chordless path on four vertices. We give a characterization of P4P4-comparability graphs in terms of an auxiliary graph being bipartite.