Fabrici, IgorIgorFabriciHarant, JochenJochenHarantMohr, SamuelSamuelMohrSchmidt, Jens M.Jens M.Schmidt2021-01-132021-01-132021-01Journal of Graph Algorithms and Applications (2021)http://hdl.handle.net/11420/8419A 3-connected graph G is essentially 4-connected if, for any 3-cut S⊆V(G) of G, at most one component of G−S contains at least two vertices. We prove that every essentially 4-connected maximal planar graph G on n vertices contains a cycle of length at least 23(n+4); moreover, this bound is sharp.en1526-171920211121132https://creativecommons.org/licenses/by/4.0/circumferencelong cycletriangulationessentially 4-connected05C38, 05C10MathematikJournal Article10.15480/882.358010.7155/jgaa.0055210.15480/882.3580Other