# simple connected planar graph with6 vertex & 12 edges , each of the face is bdd

A simple connected planar graph with 6 vertices & 12 edges. How to show each of the face is bounded by three edges.

-

Hint: how many faces are there? Then each one has a minimum of three edges in its boundary.

-
$p-q+f=2$ $p$ - vertices $q$ - edges $f$ - faces