The HeawoodGraph() command returns the Heawood graph, an undirected graph with 14 vertices and 21 edges.

$\mathrm{with}\left(\mathrm{GraphTheory}\right)\:$

$\mathrm{with}\left(\mathrm{SpecialGraphs}\right)\:$

$G≔\mathrm{HeawoodGraph}\left(\right)$

$G≔\mathrm{Graph\; 1:\; an\; undirected\; graph\; with\; 14\; vertices\; and\; 21\; edges}$

$\mathrm{IsBipartite}\left(G\right)$

$\mathrm{true}$

$\mathrm{DrawGraph}\left(G\right)$

"Heawood graph", Wikipedia. http://en.wikipedia.org/wiki/Heawood_graph