The Number Polyhedral (3-Connected Planar) Graphs

A.J.W. Duijvestijn, A.J.W. Duijvestijn

    Research output: Contribution to journalArticleAcademicpeer-review

    159 Downloads (Pure)


    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.
    Original languageUndefined
    Pages (from-to)1289-1293
    JournalMathematics of computation
    Issue number215
    Publication statusPublished - 1996


    • METIS-118494
    • IR-17975

    Cite this