Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00602609n
Noun Concept
Categories: Graphe remarquable
FR
graphe de Heawood  graphique heawood
FR
En théorie des graphes, le graphe de Heawood est un graphe cubique symétrique possédant 14 sommets et 21 arêtes. Wikipedia
Definitions
Relations
Sources
FR
En théorie des graphes, le graphe de Heawood est un graphe cubique symétrique possédant 14 sommets et 21 arêtes. Wikipedia
IS A
graphe symétrique
graphe toroïdal
graphe biparti
chemin hamiltonien
cage
+4 relations
DEPICTS
Polyèdre de Szilassi
HAS PARTS OF THE CLASS
sommet
arête
NAMED AFTER
Percy John Heawood
STUDIED BY
théorie des graphes
Wikipedia
FR
graphe de Heawood
Wikidata
FR
graphe de Heawood
Wikipedia Translations
FR
graphique 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