The Complexity of SIMPLE MAX-CUT on Comparability Graphs

We adapt a result by Masuda et al. [IEEE Transactions on Computers 39 (1990), 124-127] on FIXED LINEAR CROSSING NUMBER to show that SIMPLE MAX-CUT is NP-hard on comparability graphs.