The GrinbergGraph() command returns the Grinberg graph with 46 vertices,

This graph is an example of a 3-connected cubic graph which is not Hamiltonian.

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

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

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

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

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

$\mathrm{true}$

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

$\left[3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\,3\right]$

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