Large cycles in essentially 4-connected graphs

Michael Wigal, Xingxing Yu

Tutte proved that every 4-connected planar graph contains a Hamilton cycle, but there are 3-connected $n$-vertex planar graphs whose longest cycles have length $\Theta (n^{{\log }_{3}2})$. On…