Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01695884n
Noun Concept
NL
No term available
EN
In the mathematical field of graph theory, the Harries–Wong graph is a 3-regular undirected graph with 70 vertices and 105 edges. Wikipedia
Relations
Sources
IS A
maximale vlakke grafiek
hamiltonpad
EN
k-edge-connected graph
EN
k-vertex-connected graph
driehoek-vrije grafiek
+2 relations
HAS PARTS OF THE CLASS
geïsoleerde knoop
EN
edge
STUDIED BY
grafentheorie

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