Triangle-pentagon planar edge bound

ID: triangle-pentagon-planar-edge-bound

Let a connected bridgeless planar graph have vertices, edges, no four-cycle, and triangular faces. If no edge borders two triangular faces, then
so . The Euler formula for a connected planar graph then gives

New to topics? Read the docs here!