The number of polyhedral (3-connected planar) graphs

A.J.W. Duijvestijn, P.J. Federico

  • 24 Citations

Abstract

Data is presented on the number of 3-connected planar graphs, isomorphic to the graphs of convex polyhedra, with up to 22 edges. The numbers of such graphs having the same number of edges, and the same number of vertices and faces, are tabulated. Conjectured asymptotic formulas by W. T. Tutte and by R. C. Mullin and P. J. Schellenberg are discussed. Additional data beyond 22 edges are given enabling the number of 10-hedra to be presented for the first time, as well as estimates of the number of 11-hedra and dodecahedra.
Original languageUndefined
Pages (from-to)523-532
JournalMathematics of computation
Volume37
Issue number156
DOIs
StatePublished - 1981

Keywords

  • IR-75000

Cite this

Duijvestijn, A. J. W., & Federico, P. J. (1981). The number of polyhedral (3-connected planar) graphs. Mathematics of computation, 37(156), 523-532. DOI: 10.1090/S0025-5718-1981-0628713-3

Duijvestijn, A.J.W.; Federico, P.J. / The number of polyhedral (3-connected planar) graphs.

In: Mathematics of computation, Vol. 37, No. 156, 1981, p. 523-532.

Research output: ScientificArticle

@article{b888bc0e5caf484c8dff3e40813079ff,
title = "The number of polyhedral (3-connected planar) graphs",
abstract = "Data is presented on the number of 3-connected planar graphs, isomorphic to the graphs of convex polyhedra, with up to 22 edges. The numbers of such graphs having the same number of edges, and the same number of vertices and faces, are tabulated. Conjectured asymptotic formulas by W. T. Tutte and by R. C. Mullin and P. J. Schellenberg are discussed. Additional data beyond 22 edges are given enabling the number of 10-hedra to be presented for the first time, as well as estimates of the number of 11-hedra and dodecahedra.",
keywords = "IR-75000",
author = "A.J.W. Duijvestijn and P.J. Federico",
year = "1981",
doi = "10.1090/S0025-5718-1981-0628713-3",
volume = "37",
pages = "523--532",
journal = "Mathematics of computation",
issn = "0025-5718",
publisher = "American Mathematical Society",
number = "156",

}

Duijvestijn, AJW & Federico, PJ 1981, 'The number of polyhedral (3-connected planar) graphs' Mathematics of computation, vol 37, no. 156, pp. 523-532. DOI: 10.1090/S0025-5718-1981-0628713-3

The number of polyhedral (3-connected planar) graphs. / Duijvestijn, A.J.W.; Federico, P.J.

In: Mathematics of computation, Vol. 37, No. 156, 1981, p. 523-532.

Research output: ScientificArticle

TY - JOUR

T1 - The number of polyhedral (3-connected planar) graphs

AU - Duijvestijn,A.J.W.

AU - Federico,P.J.

PY - 1981

Y1 - 1981

N2 - Data is presented on the number of 3-connected planar graphs, isomorphic to the graphs of convex polyhedra, with up to 22 edges. The numbers of such graphs having the same number of edges, and the same number of vertices and faces, are tabulated. Conjectured asymptotic formulas by W. T. Tutte and by R. C. Mullin and P. J. Schellenberg are discussed. Additional data beyond 22 edges are given enabling the number of 10-hedra to be presented for the first time, as well as estimates of the number of 11-hedra and dodecahedra.

AB - Data is presented on the number of 3-connected planar graphs, isomorphic to the graphs of convex polyhedra, with up to 22 edges. The numbers of such graphs having the same number of edges, and the same number of vertices and faces, are tabulated. Conjectured asymptotic formulas by W. T. Tutte and by R. C. Mullin and P. J. Schellenberg are discussed. Additional data beyond 22 edges are given enabling the number of 10-hedra to be presented for the first time, as well as estimates of the number of 11-hedra and dodecahedra.

KW - IR-75000

U2 - 10.1090/S0025-5718-1981-0628713-3

DO - 10.1090/S0025-5718-1981-0628713-3

M3 - Article

VL - 37

SP - 523

EP - 532

JO - Mathematics of computation

T2 - Mathematics of computation

JF - Mathematics of computation

SN - 0025-5718

IS - 156

ER -

Duijvestijn AJW, Federico PJ. The number of polyhedral (3-connected planar) graphs. Mathematics of computation. 1981;37(156):523-532. Available from, DOI: 10.1090/S0025-5718-1981-0628713-3