Decomposing $4$-connected planar triangulations into two trees and one path

Kolja Knauer, Torsten Ueckerdt

Refining a classical proof of Whitney, we show that any $4$-connected planar triangulation can be decomposed into a Hamiltonian path and two trees. Therefore, every $4$-connected p…