Computational Complexity of Maximum Cut on Interval Graphs of Interval Count Two

Maximum Cut is NP-complete on interval graphs of interval count two.