Heawood graph
Jump to navigation
Jump to search
English[edit]
Etymology[edit]
Named after Percy John Heawood.
Noun[edit]
Heawood 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)