Heawood conjecture (English, name)
expansion: the Heawood conjecture
Senses:
topics: graph-theory
mathematics
sciences
glosses: A conjecture (proven in 1968) that gives a lower bound for the number of colors that are necessary for graph coloring on a surface of a given genus.
Forms:
form: the Heawood conjecture
tags: canonical