# Simple connected planar graph with $6$ vertex and $12$ edges , each of the face is bdd

A simple connected planar graph with $6$ vertices and $12$ edges. How do we show that 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