plantri and fullgen
Library Home || Full Table of Contents || Library Help
|Gunnar Brinkmann, University of Bielefeld, and Brendan McKay, Australian National University.|
|Programs for generating certain types of planar graph. Graphs are generated in such a way that exactly one member of each isomorphism class is output without the need for storing them. The speed of generation is more than 100,000 graphs per second in most cases, so extremely large classes of graph can be exhaustively listed.|
|Resource Types:||Topic Tools Miscellaneous|
|Math Topics:||Graph Theory|
© 1994- The Math Forum at NCTM. All rights reserved.