The existence of orderly analogues of graph generators proposed by Heap and Farrell is established. The modifications to these algorithms supply practical methods enabling one to generate exhaustive lists of graphs and locally restricted graphs; moreover, the difficulty involved in ensuring that no duplications occur in the list is greatly reduced.
- graph generation
- locally restricted graph
- orderly algorithm
ASJC Scopus subject areas
- Computer Science Applications
- Computational Theory and Mathematics
- Applied Mathematics