Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00817721n
Noun Concept
Categories: Topological graph theory, Graph coloring, Theorems in graph theory
EN
Heawood conjecture  Ringel–Youngs theorem  Ringel-Youngs theorem
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
Definitions
Relations
Sources
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
Theorem on the number of colors needed for graphs embedded on higher genus surfaces Wikidata
IS A
theorem
NAMED AFTER
Gerhard Ringel
Percy John Heawood
John William Theodore Youngs
Wikipedia
EN
Heawood conjecture
Wikidata
EN
Ringel–Youngs theorem
Wikipedia Redirections
EN
Ringel-Youngs theorem, Ringel–Youngs theorem
Wikidata Alias
EN
Heawood conjecture

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