If every face of a connected planar graph has size at least , double-counting edge-face incidences and using Euler's formula gives
(1)

Ancestors (7)

  1. Euler formula for a connected planar graph
  2. Planar graph
  3. Graph theory
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7. Home

Incoming links (1)

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version