Assertion: planar graph | /r/HasProperty | both vertex-transitive
Facets:
Source sentences:
text: Every connected symmetric graph must thus be both vertex-transitive and edge-transitive, and the converse is true for graphs of odd degree.