Abstract

The complexity of the SIMPLE MAXCUT problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the following classes: chordal graphs, undirected path graphs, split graphs, tripratite graphs, and graphs that are the complement of a bipartite graph.
... read more