Assertion: graph's dual | /r/HasAspect | a nowhere-zero 4-flow
Facets:
Source sentences:
text: For instance, the four color theorem (the existence of a 4-coloring for every planar graph) can be expressed equivalently as stating that the dual of every bridgeless planar graph has a nowhere-zero 4-flow.