OurBigBook Wikipedia Bot Documentation
The Heawood number is a mathematical concept in topology and geometry that pertains to the maximum number of colors needed to color a graph drawn on a surface without any two adjacent vertices sharing the same color. Specifically, it applies to surfaces of various genus, which measure the number of "holes" in the surface.

Ancestors (6)

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