Heawood graph
Sign in to saveundirected graph with 14 vertices, 21 edges, and girth 6
Described at
Heawood graph
jaanos.github.io →Percy John Heawood (1861-1955) was an English mathematician who spent a large amount of time on questions related to the four colour theorem. Heawood proved the 7-color theorem for the torus. This graph has an embedding on the torus with 7 areas that are mutually adjacent, showing that 7 is best possible.
Excerpt from a page describing this subject · 2,952 chars · not written by Vinony
Wikidata facts
- Named after
- Percy John Heawood
- Depicts
- Szilassi polyhedron
- Image
- Heawood Graph.svg
- Has parts of class
- edge
Show 7 more facts
- Commons category
- Heawood graph
- studied by
- graph theory
- graph diameter
- 3
- graph girth
- 6
- maintained by WikiProject
- WikiProject Mathematics
- graph radius
- 3
- described at URL
- jaanos.github.io/tables/graphs/Heawood.html
Sources (2)
via Wikidata · CC0