Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00602609n
Noun Concept
Categories: Regular graphs, Individual graphs
EN
Heawood graph
EN
In the mathematical field of graph theory, the Heawood graph is an undirected graph with 14 vertices and 21 edges, named after Percy John Heawood. Wikipedia
Definitions
Relations
Sources
EN
In the mathematical field of graph theory, the Heawood graph is an undirected graph with 14 vertices and 21 edges, named after Percy John Heawood. Wikipedia
Undirected graph with 14 vertices, 21 edges, and girth 6 Wikidata
IS A
symmetric graph
toroidal graph
bipartite graph
Hamiltonian path
cage
+4 relations
DEPICTS
Szilassi polyhedron
HAS PARTS OF THE CLASS
vertex
edge
NAMED AFTER
Percy John Heawood
STUDIED BY
graph theory
Wikipedia
EN
Heawood graph
Wikidata
EN
Heawood 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