Heawood graph
English
editEtymology
editNamed after Percy John Heawood.
Noun
editHeawood graph (plural Heawood graphs)
- (graph theory) An undirected graph with 14 vertices and 21 edges.
Named after Percy John Heawood.
Heawood graph (plural Heawood graphs)