Assertion: planar graph | /r/HasProperty | eulerian
Facets:
Source sentences:
text: A connected planar graph is Eulerian (has even degree at every vertex) if and only if its dual graph is bipartite.