Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02356765n
Noun Concept
Categories: Combinatorics stubs, Graph families
EN
Descartes snark
EN
In the mathematical field of graph theory, a Descartes snark is an undirected graph with 210 vertices and 315 edges. Wikipedia
Definitions
Relations
Sources
EN
In the mathematical field of graph theory, a Descartes snark is an undirected graph with 210 vertices and 315 edges. Wikipedia
IS A
snark
cubic graph
BASED ON
Petersen graph
NAMED AFTER
Descartes
STUDIED BY
graph theory
Wikipedia
EN
Descartes snark
Wikidata
EN
Descartes 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