Every maximal planar graph
G with [absolute value of G] [greater than or equal to] 4 contains a connected Eulerian spanning subgraph.
It was presented in 1972 as an example of a maximal planar nontraceable graph of smallest order by Goodey , who also proved that every maximal planar graph
of order less than 14 is traceable.
In a maximal planar graph
G = ((V (G), E(G)) with [absolute value of V (G)]=n and [absolute value of E (G)]=m, we have m = 3n - 6.