In this work we present an algorithm with which any arbitrary cubic planar map may be constructed through successive edge insertion while simultaneously constructing a set of proper edge labels and Hamiltonian cycles for each configuration. We present a publicly available Python implementation of this algorithm, and discuss both theoretical and numerical support for its validity, with reference to the well-known Four Colour Theorem.