Longer Cycles in Essentially 4-Connected Planar Graphs

Igor Fabrici, Jochen Harant, Samuel Mohr +1

A planar 3-connected graph $G$ is called \emph{essentially $4$-connected} if, for every 3-separator $S$, at least one of the two components of $G-S$ is an isolated vertex. Jackson…