Assertion: complete graph | /r/HasProperty | k 3,3
Facets:
Source sentences:
text: The theory of graph minors began with Wagner's theorem that a graph is planar if and only if its minors include neither the complete graph K 5 nor the complete bipartite graph K 3,3 .