Orderly Algorithms for Graph Generation

Charles J. Colbourn, Ronald C. Read

Research output: Contribution to journalArticlepeer-review

26 Scopus citations

Abstract

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.

Original languageEnglish (US)
Pages (from-to)167-172
Number of pages6
JournalInternational Journal of Computer Mathematics
Volume7
Issue number3
DOIs
StatePublished - Jan 1 1979
Externally publishedYes

Keywords

  • Graph
  • graph generation
  • locally restricted graph
  • orderly algorithm

ASJC Scopus subject areas

  • Computer Science Applications
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Orderly Algorithms for Graph Generation'. Together they form a unique fingerprint.

Cite this