The number of polyhedral (3-connected planar) graphs

DOI10.1090/S0025-5718-96-00749-1MaRDI QIDQ4889935zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• The number of labeled 2-connected planar graphs
• scientific article; zbMATH DE number 4055646
• scientific article; zbMATH DE number 1792067
• Some New Polyhedra with Vertex Degree 4 and/or 5 Only

Cites work

• scientific article; zbMATH DE number 3166039 (Why is no real title available?)
• scientific article; zbMATH DE number 3166587 (Why is no real title available?)
• A Census of Planar Maps
• On the number of rooted c-nets
• Simple Perfect Squared Squares and 2 × 1 Squared Rectangles of Order 25
• Simple perfect squared squares and 2×1 squared rectangles of order 26
• Simple perfect squared squares and \(2\times 1\) squared rectangles of orders 21 to 24
• The Number of Polyhedral (3-Connected Planar) Graphs
• The dissection of rectangles into squares
• The enumeration of c-nets via quadrangulations

Cited in

(6)

• (3,3)-linked planar graphs
• On the construction of planar embedding for a class of orthogonal polyhedra
• The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree
• Some New Polyhedra with Vertex Degree 4 and/or 5 Only
• Enumeration of corner polyhedra and 3-connected Schnyder labelings
• Enumeration of corner polyhedra and 3-connected Schnyder labelings

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4889935)