Assertion: graph's g | /r/HasProperty | planar
Facets:
Source sentences:
text: If every edge of a given graph G is subdivided, the resulting graph is a string graph if and only if G is planar.
text: A bipartite graph G is a planar graph if and only if it does not have the utility graph K 3,3 as a bipartite minor.
text: If G is planar, the dual matroid is the graphic matroid of the dual graph of G.
text: In cases where H is not fixed, faster algorithms are known in the case where G is planar.