Assertion: graph | /r/HasAspect | neither k
Facets:
Source sentences:
text: The best-known example of a characterization of this type is Wagner's theorem characterizing the planar graphs as the graphs having neither K 5 nor K 3,3 as minors.