Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03250527n
Noun Concept
Categories: Individual graphs, Combinatorics stubs, Regular graphs
EN
Szekeres snark
EN
In the mathematical field of graph theory, the Szekeres snark is a snark with 50 vertices and 75 edges. Wikipedia
Definitions
Relations
Sources
EN
In the mathematical field of graph theory, the Szekeres snark is a snark with 50 vertices and 75 edges. Wikipedia
IS A
hypohamiltonian graph
k-edge-connected graph
snark
k-vertex-connected graph
DISCOVERER OR INVENTOR
George Szekeres
HAS PARTS OF THE CLASS
vertex
edge
NAMED AFTER
George Szekeres
STUDIED BY
graph theory
Wikipedia
EN
Szekeres snark
Wikidata
EN
Szekeres 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