Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)

 
 

 

The number of polyhedral
(3-Connected Planar) Graphs


Author: A. J. W. Duijvestijn
Journal: Math. Comp. 65 (1996), 1289-1293
MSC (1991): Primary 05C30; Secondary 52B05
DOI: https://doi.org/10.1090/S0025-5718-96-00749-1
MathSciNet review: 1348044
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: Data is presented on the number of 3-connected planar graphs, isomorphic to the graphs of convex polyhedra, with up to 26 edges. Results have been checked with the the number of rooted c-nets of R.C. Mullin and P.J. Schellenberg and Liu Yanpei.


References [Enhancements On Off] (What's this?)

  • 1. R.L. Brooks, C.A.B. Smith, A.H. Stone, and W.T. Tutte, The dissection of rectangles into squares, Duke Mathematical Journal 7 (1940), 312--340. MR 2:153d
  • 2. A.J.W. Duijvestijn, Simple perfect squared squares and $2\times 1$ squared rectangles of order 26, Mathematics of Computation,65(1996)to appear.
  • 3. ------, Electronic computation of squared rectangles, Ph.D. thesis, Technological University Eindhoven, 1962. MR 26:2036
  • 4. ------, Electronic computation of squared rectangles, Philips Research Reports 17 (1962), 523--612.
  • 5. ------, Algorithmic calculation of the order of the automorphism group of a graph, Memorandum 221, Twente University of Technology, The Netherlands, 1978.
  • 6. ------, Simple perfect squared squares and $2\times 1$ squared rectangles of orders 21 to 24, Journal of Combinatorial Theory B 59 (1993), 26--34. MR 94c:05017
  • 7. ------, Simple perfect squared squares and $2\times 1$ squared rectangles of order 25, Mathematics of Computation 62 (1994), 325--332. MR 94c:05023
  • 8. A.J.W. Duijvestijn and P.J. Federico, The number of polyhedral (3-connected planar ) graphs, Mathematics of Computation 37 (1981), 523--532. CMP 95:17
  • 9. Yanpei Liu, On the number of rooted c-nets, Journal of Combinatorial Theory B 36 (1984), 118--123. MR 85k:05060
  • 10. Dillencourt M.B., 1991, private communication.
  • 11. R.C. Mullin and P.J. Schellenberg, The enumeration of c-nets via quadrangulations, Journal of Combinatorial Theory B 4 (1968), 259--276. MR 36:1362
  • 12. W.T. Tutte, A theory of 3-connected graphs, Kon. Nederl. Akad. Wetensch., vol.64, 1961, (= Indag. Math. 23 (1961), 441--455). MR 25:3517
  • 13. W.T Tutte, A census of planar maps, Canadian Journal of Mathematics 15 (1963), 249--271. MR 26:4343

Similar Articles

Retrieve articles in Mathematics of Computation of the American Mathematical Society with MSC (1991): 05C30, 52B05

Retrieve articles in all journals with MSC (1991): 05C30, 52B05


Additional Information

A. J. W. Duijvestijn
Affiliation: Department of Informatics, Technological University Twente, Enschede, The Netherlands
Email: infdvstn@cs.utwente.nl

DOI: https://doi.org/10.1090/S0025-5718-96-00749-1
Keywords: Graph theory, 3-connected graphs, polyhedral graphs
Received by editor(s): February 16, 1995
Article copyright: © Copyright 1996 American Mathematical Society

American Mathematical Society