Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:04840903n
Noun Named Entity
Categories: Graphe remarquable
FR
graphe 4-chromatique de Heawood
FR
Le graphe 4-chromatique de Heawood est, en théorie des graphes, un graphe possédant 25 sommets et 69 arêtes. Wikipedia
Definitions
Relations
Sources
FR
Le graphe 4-chromatique de Heawood est, en théorie des graphes, un graphe possédant 25 sommets et 69 arêtes. Wikipedia
IS A
graphe asymétrique
graphe planaire
graphe régulier
HAS PARTS OF THE CLASS
sommet
arête
STUDIED BY
théorie des graphes
Wikipedia
FR
graphe 4-chromatique de Heawood
Wikidata
FR
Graphe 4-chromatique de Heawood

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