Articles
Fast generation of some classes of planar graphs

https://doi.org/10.1016/S1571-0653(05)80016-2Get rights and content

Abstract

In the talk we present an efficient algorithm to construct all non isomorphic triangulations of the sphere and their duals, that is: cubic polyhedra. Furthermore we present some extensions to the algorithm that make it applicable also for polyhedra, connected cubic planar graphs and triangulations of the disc.

References (14)

  • M.B. Dillencourt

    Polyhedra of small order and their hamiltonian properties

    J. Combin. Theory

    (1996)
  • B.D. McKay

    Isomorph-free exhaustive generation

    Journal of Algorithms

    (1998)
  • D. Avis. Generating rooted triangulations without repititions. Technical report, McGill University, Montréal, Canada,...
  • G. Brinkmann. Isomorphism rejection in structure generation programs. to appear in the Proceedings of the DIMACS...
  • D. Britton et al.

    A complete catalogue of polyhedra with 8 or fewer vertices

    Acta Cryst.

    (1973)
  • P.R. Cromwell

    Polyhedra

    (1997)
There are more references available in the full text version of this article.

Cited by (0)

View full text