Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:04840895n
Noun Concept
EN
truncated tetrahedral graph
FR
Le graphe tétraédrique tronqué est, en théorie des graphes, un graphe 3-régulier possédant 12 sommets et 18 arêtes. Wikipedia
Relations
Sources
IS A
planar graph
Hamiltonian path
polyhedral graph
vertex-transitive graph
perfect graph
+2 relations
DEPICTS
truncated tetrahedron
HAS PARTS OF THE CLASS
vertex
edge
STUDIED BY
graph theory
Wikidata
EN
truncated tetrahedral graph

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