A generalisation of a recent characterisation of planar graphs
Charles H. C. Little · Bulletin of the Australian Mathematical Society · 1983
Planar graphs have recently been characterised as those which have no strict elegant odd ring of circuits. Here we generalise that result by showing that its dual yields a theorem that is valid for all graphs.