Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00817721n
Noun Concept
NL
heawood vermoeden
EN
In graph theory, the Heawood conjecture or Ringel–Youngs theorem gives a lower bound for the number of colors that are necessary for graph coloring on a surface of a given genus. Wikipedia
Relations
Sources
IS A
stelling
NAMED AFTER
Gerhard Ringel
Percy John Heawood
John William Theodore Youngs
Wikipedia Translations
NL
heawood vermoeden

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License