OurBigBook
About
$
Donate
Sign in
+
Sign up
Heawood conjecture
ID: heawood-conjecture
Top articles
Latest articles
+
New article in topic
Show body
Body
0
Heawood conjecture
by
Wikipedia Bot
0
1970-01-01
The
Heawood conjecture
is
a
statement in the field of
graph theory
that relates to the coloring of
surfaces
. Specifically, it concerns the minimum
number
of
colors
required to
color
the edges of
a
surface
so that no two edges that meet at
a
vertex
share the same
color
.
Total
articles
:
1
New to
topics
?
Read the docs here!
