Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:04840900n
Noun Concept
SYL
No term available
FR
Le graphe tétraédrique est, en théorie des graphes, un graphe 3-régulier possédant 4 sommets et 6 arêtes. Wikipedia
Relations
Sources
IS A
EN
strongly regular graph
EN
symmetric graph
EN
wheel graph
EN
planar graph
EN
Hamiltonian path
+11 relations
DEPICTS
EN
tetrahedron
EN
regular tetrahedron
DUAL TO
EN
Tetrahedral graph
HAS PARTS OF THE CLASS
EN
vertex
EN
edge
STUDIED BY
EN
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