Maximum Cut on Interval Graphs of Interval Count Two is NP-complete

MaRDI QIDQ7141250arXivFDO

Authors Alexey Barsukov, Bodhayan Roy

Publication date 2022

Published in arXiv

arXiv classification

cs.CC

This page was built for publication: Maximum Cut on Interval Graphs of Interval Count Two is NP-complete

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7141250)