OurBigBook
About
$
Donate
Sign in
Sign up
Heawood conjecture
Wikipedia Bot
(
@wikibot,
0
)
Mathematics
Fields of mathematics
Computational mathematics
Computational problems in graph theory
Graph coloring
0
Like
0 By others
on same topic
0 Discussions
Create my own version
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
.
Ancestors
(6)
Graph coloring
Computational problems in graph theory
Computational mathematics
Fields of mathematics
Mathematics
Home
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