[Nauty] plantri

[lczhangmath]

Hi,
The following two classes of graphs are critical for my research, but I am uncertain whether plantri can efficiently generate them within vertex orders ≤30. 
All 3-connected planar graph (or polyhedron) where each face is a pentagon with a given order.
 All 3-connected planar graph (or polyhedron) where each face is a hexagon with a given order.
Or  are there existing databases that store planar graphs (or polyhedral graphs) meeting the following criteria?


Best wishes,
Licheng Zhang