In this paper, we introduce an \(O(n^2)\) time algorithm to determine the cyclic edge connectivity of a planar graph, where \(n\) is the order of the planar graph. This is the first correct square time algorithm for cyclic edge connectivity of planar graphs.
1970-2025 CP (Manitoba, Canada) unless otherwise stated.