Assertion: undirected graph | /r/HasProperty | recognized in polynomial time
Facets:
Source sentences:
text: Bipartite graphs may be recognized in polynomial time but, for any k > 2 it is NP-complete, given an uncolored graph, to test whether it is k-partite.