Wiktionary

Heawood graph

English edit

 
English Wikipedia has an article on:
Wikipedia

Etymology edit

Named after Percy John Heawood.

Noun edit

Heawood graph (plural Heawood graphs)

  1. (graph theory) An undirected graph with 14 vertices and 21 edges.
Retrieved from "https://en.wiktionary.org/w/index.php?title=Heawood_graph&oldid=72922601"