Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:04840903n
Noun Named Entity
EN
No term available
FR
Le graphe 4-chromatique de Heawood est, en théorie des graphes, un graphe possédant 25 sommets et 69 arêtes. Wikipedia
Relations
Sources
IS A
asymmetric graph
planar graph
regular graph
HAS PARTS OF THE CLASS
vertex
edge
STUDIED BY
graph theory

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