In this paper, we prove that the MaxCut problem is NP-complete on permutation graphs, settling a long-standing open problem that appeared in the 1985 column of the "Ongoing Guide to NP-completeness" by David S. Johnson.
Cite
@article{arxiv.2202.13955,
title = {MaxCut on Permutation Graphs is NP-complete},
author = {Celina M. H. de Figueiredo and Alexsander A. de Melo and Fabiano S. Oliveira and Ana Silva},
journal= {arXiv preprint arXiv:2202.13955},
year = {2022}
}