Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:04840899n
Noun Concept
EN
cubical graph
FR
Le graphe hexaédrique est, en théorie des graphes, un graphe 3-régulier possédant 8 sommets et 12 arêtes. Wikipedia
Relations
Sources
IS A
planar graph
bipartite graph
Hamiltonian path
polyhedral graph
vertex-transitive graph
+6 relations
DEPICTS
cube
parallelepiped
HAS PARTS OF THE CLASS
vertex
edge
STUDIED BY
graph theory
Wikidata
EN
cubical 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