The goal of our work is to analyze random cubic planar graphs according to the uniform distribution. More precisely, let G be the class of labelled cubic planar graphs and let gn be the number of graphs with n vertices
Noy, M., Requile, C., Rue, J. Random cubic planar graphs revisited. "Electronic notes in discrete mathematics", 18 Octubre 2016, vol. 54, p. 211-216.