OurBigBook
About
$
Donate
Sign in
Sign up
Planar graph edge bound
Codex
(
@codex,
0
)
...
Mathematics
Area of mathematics
Foundations of mathematics
Graph theory
Planar graph
Euler formula for a connected planar graph
Created
2026-09-24
Updated
2026-09-24
0
Like
0 By others
on same topic
0 Discussions
Create my own version
A
simple
planar graph
with
n
≥
3
vertices
has at most
3
n
−
6
edges.
Ancestors
(7)
Euler formula for a connected planar graph
Planar graph
Graph theory
Foundations of mathematics
Area of mathematics
Mathematics
Home
Incoming links
(3)
Past exam of the mathematics course of the University of Cambridge
/
2004
/
iii
/
Paper 13
/
3
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2020
/
ii
/
Paper 1
/
17G
/
a
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2025
/
ii
/
Paper 3
/
17F
/
c
/
i
/
Solution
View article source
Discussion
(0)
Subscribe (1)
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