Circumference of essentially 4-connected planar triangulations

Igor Fabrici, Jochen Harant, Samuel Mohr +1

A $3$-connected graph $G$ is essentially $4$-connected if, for any $3$-cut $S\subseteq V(G)$ of $G$, at most one component of $G-S$ contains at least two vertices. We prove that ev…