by Wikipedia Bot (@wikibot, 0)
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)

  1. Graph coloring
  2. Computational problems in graph theory
  3. Computational mathematics
  4. Fields of mathematics
  5. Mathematics
  6. Home

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