[Nauty] plantri

[lczhangmath]

I forgot that there is no planar graph with every face of length 6. I first use the 5-regular graph data. If it is not enough,I will send you email again. Thank you! Licheng

---- Replied Message ----
| From | lczhangmath via Nauty<nauty at anu.edu.au> |
| Date | 05/07/2025 17:39 |
| To | Brendan McKay<brendan.mckay at anu.edu.au> |
| Cc | nauty<nauty at anu.edu.au> |
| Subject | Re: [Nauty] plantri |
Hi  Prof. Brendan.<br/>Thank you very much. That portion (or those aspects) are sufficient for my needs.<br/><br/>Licheng
At 2025-05-07 17:24:57, "Brendan McKay via Nauty" <nauty at anu.edu.au> wrote:
>You can find the planar pentangulations up to 56 vertices as the duals
>of the
>5-regular planar graphs at
>https://users.cecs.anu.edu.au/~bdm/data/planegraphs.html
>but you need to filter out the minority that are not 3-connected.
>If 56 vertices is not enough, contact me for a program.
>
>There are no planar graphs with every face of length 6.
>
>Brendan.
>
>On 7/5/2025 6:44 pm, lczhangmath via Nauty wrote:
>> 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
>> _______________________________________________
>> Nauty mailing list
>> Nauty at anu.edu.au
>> https://mailman.anu.edu.au/mailman/listinfo/nauty
>
>_______________________________________________
>Nauty mailing list
>Nauty at anu.edu.au
>https://mailman.anu.edu.au/mailman/listinfo/nauty

_______________________________________________
Nauty mailing list
Nauty at anu.edu.au
https://mailman.anu.edu.au/mailman/listinfo/nauty