Assertion: resulting graph | /r/HasProperty | bipartite
Facets:
Source sentences:
text: Odd cycle transversal is an NP-complete algorithmic problem that asks, given a graph G = (V,E) and a number k, whether there exists a set of k vertices whose removal from G would cause the resulting graph to be bipartite.