sentence1: subsequently , epstein et al showed that this problem is np-complete on split graphs , bipartite and co-bipartite graphs .
sentence2: on the negative side , epstein et al provided np-hardness results for split graphs , bipartite graphs , co-bipartite graphs , and line graphs of bipartite graphs .