The number of polyhedral (3-connected planar) graphs
From MaRDI portal
Publication:4889935
DOI10.1090/S0025-5718-96-00749-1zbMATH Open0856.05052OpenAlexW2156550467MaRDI QIDQ4889935FDOQ4889935
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
Recommendations
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Enumeration in graph theory (05C30)
Cites Work
- A Census of Planar Maps
- Title not available (Why is that?)
- The dissection of rectangles into squares
- The enumeration of c-nets via quadrangulations
- Simple Perfect Squared Squares and 2 × 1 Squared Rectangles of Order 25
- Title not available (Why is that?)
- On the number of rooted c-nets
- Simple perfect squared squares and \(2\times 1\) squared rectangles of orders 21 to 24
- Simple perfect squared squares and 2×1 squared rectangles of order 26
- The Number of Polyhedral (3-Connected Planar) Graphs
Cited In (6)
- Enumeration of corner polyhedra and 3-connected Schnyder labelings
- Enumeration of corner polyhedra and 3-connected Schnyder labelings
- The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree
- (3,3)-linked planar graphs
- On the construction of planar embedding for a class of orthogonal polyhedra
- Some New Polyhedra with Vertex Degree 4 and/or 5 Only
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)
