The RobertsonGraph() command returns the Robertson graph, a 4-regular undirected graph with 19 vertices and 38 edges.

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

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

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

$G≔\mathrm{Graph\; 1:\; an\; undirected\; graph\; with\; 19\; vertices\; and\; 38\; edge(s)}$

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

$\mathrm{false}$

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

"Robertson graph", Wikipedia. http://en.wikipedia.org/wiki/Robertson_graph