Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03594714n
Noun Concept
EL
γράφει
EN
In the mathematical field of graph theory, a snark is an undirected graph with exactly three edges per vertex whose edges cannot be colored with only three colors. Wikipedia
English:
graph theory
Relations
Sources
IS A
συνδεδεμένο γράφημα
κυβικό γράφημα
HAS KIND
λουλούδι γράφει
blanuša snarks
EN
Descartes snark
EN
Watkins snark
EN
double-star snark
+1 relations
HAS INSTANCE
EN
Foster graph
γράφημα petersen
EN
Tietze's graph
EN
Watkins snark
EN
double-star snark
+4 relations
NAMED AFTER
snark
STUDIED BY
θεωρία γράφων
Wikipedia Translations
EL
γράφει

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