The number of polyhedral (3-connected planar) graphs

DOI10.1090/S0025-5718-96-00749-1zbMath0856.05052OpenAlexW2156550467MaRDI QIDQ4889935

A. J. W. Duijvestijn

Publication date: 17 February 1997

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-96-00749-1

zbMATH Keywords

3-connected planar graphs

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Enumeration in graph theory (05C30)

Related Items (1)

On the construction of planar embedding for a class of orthogonal polyhedra

Cites Work

• Unnamed Item
• Unnamed Item
• On the number of rooted c-nets
• Simple perfect squared squares and \(2\times 1\) squared rectangles of orders 21 to 24
• The dissection of rectangles into squares
• The Number of Polyhedral (3-Connected Planar) Graphs
• Simple Perfect Squared Squares and 2 × 1 Squared Rectangles of Order 25
• Simple perfect squared squares and 2×1 squared rectangles of order 26
• The enumeration of c-nets via quadrangulations
• A Census of Planar Maps

This page was built for publication: The number of polyhedral (3-connected planar) graphs