Abstract
We study max-cut in classes of graphs defined by forbidding finitely many graphs as subgraphs, or a single graph as an induced subgraph or a minor. For the first two containment relations, we prove dichotomy theorems. For the minor order, we show how to solve max-cut in polynomial time for the class obtained by forbidding a graph with a single crossing (this generalizes a known result for K5-minor-free graphs) and identify an open problem which is the missing case for a dichotomy theorem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
