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. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Heawood Graph
Filter Results1 entry
Connections
Attributed To
Source Heawood Graph (Wikipedia)
In Branch
Source Heawood Graph (Wikipedia)
Is Kind Of Object
Principal Result Of
Source Heawood Graph (Wikipedia)
Sources
1. Heawood Graph (Wikipedia)
Lead section
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.
Lead
The map and graph were discovered by Percy John Heawood in 1890, who proved that no map on the torus could require more than seven colors and thus this map is maximal.
Principal Result Of: Percy John Heawood, Lead sentence of the article on the result
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.
In Branch: Graph Theory, Lead sentence
In the mathematical field of graph theory, the Heawood graph is an undirected graph with 14 vertices and 21 edges, named after Per
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.