Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01811747n
Noun Concept
Categories: Hamiltonian paths and cycles, Planar graphs, Individual graphs
EN
Herschel graph
EN
In graph theory, a branch of mathematics, the Herschel graph is a bipartite undirected graph with 11 vertices and 18 edges. Wikipedia
Definitions
Relations
Sources
EN
In graph theory, a branch of mathematics, the Herschel graph is a bipartite undirected graph with 11 vertices and 18 edges. Wikipedia
A bipartite undirected graph Wikipedia Disambiguation
bipartite undirected graph Wikidata
A bipartite undirected graph with 11 vertices and 18 edges that is the smallest non-Hamiltonian polyhedral graph. Wiktionary
IS A
planar graph
bipartite graph
polyhedral graph
perfect graph
k-vertex-connected graph
DEPICTS
enneahedron
HAS PARTS OF THE CLASS
vertex
edge
NAMED AFTER
Alexander Stewart Herschel
STUDIED BY
graph theory
Wikipedia
EN
Herschel graph
Wikidata
EN
Herschel graph
Wiktionary
EN
Herschel graph

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