Keywords

#heawood_graph

Heawood graph

Undirected graph with 14 vertices

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.

Wed 14th

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Heawood graph Heawood conjecture Toroidal graph Bipartite graph Heawood Heawood family 1-planar graph Percy John Heawood Fano plane Girth (graph theory)
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.