Maximum Cut on Interval Graphs of Interval Count Four is NP-Complete

Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Fabiano de S. Oliveira, Ana Silva 0001. Maximum Cut on Interval Graphs of Interval Count Four is NP-Complete. Discrete & Computational Geometry, 71(3):893-917, April 2024. [doi]

Abstract

Abstract is missing.