Before revision:  Using isolating cycles, we improve the lower bound to match the upper (up to a summand +1). This settles the long-standing open problem of determining the circumference of essentially 4-connected planar graphs .
After revision:  Using isolating cycles, we improve the lower bound to match the upper . All our results are tight .