A049373 Number of n-node planar graphs with minimum degree at least 5.

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 5, 8, 30, 85, 392, 1587, 7659, 36309, 180642, 899574, 4541403

Offset: 1

Author

Brendan McKay

Keywords

• nonn
• nice
• hard

References

• M. Kirchweger, M. Scheucher, and S. Szeider, SAT-Based Generation of Planar Graphs, in preparation.

Links

• CombOS - Combinatorial Object Server, generate planar graphs
• Eric Weisstein's World of Mathematics, Planar Graph.

Extensions

a(26) from Manfred Scheucher, Mar 21 2023