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]

@article{FigueiredoMOS24,
  title = {Maximum Cut on Interval Graphs of Interval Count Four is NP-Complete},
  author = {Celina M. H. de Figueiredo and Alexsander Andrade de Melo and Fabiano de S. Oliveira and Ana Silva 0001},
  year = {2024},
  month = {April},
  doi = {10.1007/s00454-023-00508-x},
  url = {https://doi.org/10.1007/s00454-023-00508-x},
  researchr = {https://researchr.org/publication/FigueiredoMOS24},
  cites = {0},
  citedby = {0},
  journal = {Discrete & Computational Geometry},
  volume = {71},
  number = {3},
  pages = {893-917},
}