How can I visualize the identity $m\leq3n-6$ (where $m$ is the number of edges, $n$ the number of vertices) for simple connected finite planar graphs?
Visualizing identity $m\le3n-6$ for simple connected finite planar graphs
4
$\begingroup$
combinatorics
graph-theory
differential-topology
visualization
-
0Your intuition, that it might have visual meaning, is correct. – 2012-04-29