Packings and perfect path double covers of maximal planar graphs (Q686163)

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. It is shown that if the minimum degree of maximal planar graph is at least 4, then it has a perfect packing by 2-cliques and facial triangles. Such a perfect packing gives a perfect path double cover (PPDC) of a maximal planar graph such that the sequence of lengths of the paths in the PPDC is the same as the degree sequence of the graph. It is asked which graph contains a PPDC with this property. In particular, Bondy conjectures that regular graphs have such PPDCs.