ArticlesFast generation of some classes of planar graphs
References (14)
Polyhedra of small order and their hamiltonian properties
J. Combin. Theory
(1996)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...
- et al.
A complete catalogue of polyhedra with 8 or fewer vertices
Acta Cryst.
(1973) Polyhedra
(1997)
There are more references available in the full text version of this article.
Cited by (0)
Copyright © 2004 Elsevier Ltd. All rights reserved.