Assertion: graph's girth | /r/HasProperty | the size of its smallest cycle
Facets:
Source sentences:
text: The girth of any planar graph (the size of its smallest cycle) equals the edge connectivity of its dual graph (the size of its smallest cutset).