A maximal planar graph is a simple planar graph in which every face is a triangle, and a perfect packing of such a graph by 2-cliques and facial triangles corresponds to a partition of the vertex set into classes, each of which induces either a 2-clique or a facial triangle in the graph. We prove a sufficient condition for a maximal planar graph to have a perfect packing by 2-cliques and facial triangles. This result then leads to a construction of a special type of perfect path double cover of a maximal planar graph. © 1993.
Seyffarth, K. (1993). Packings and perfect path double covers of maximal planar graphs. Discrete Mathematics, 117(1–3), 183–195. https://doi.org/10.1016/0012-365X(93)90334-P