Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03594714n
Noun Concept
PT
snark
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
conectividade
grafo cúbico
HAS KIND
snark flor
snarks blanuša
EN
Descartes snark
EN
Watkins snark
snark estrela dupla
+1 relations
HAS INSTANCE
grafo de Foster
grafo de Petersen
EN
Tietze's graph
EN
Watkins snark
snark estrela dupla
+4 relations
NAMED AFTER
snark
STUDIED BY
teoria dos grafos
Wikidata
PT
snark
Wikipedia Translations
PT
snark

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