Orderly Algorithms for Graph Generation

Charles J. Colbourn; Ronald C. Read

doi:10.1080/00207167908803169

Orderly Algorithms for Graph Generation

Charles J. Colbourn, Ronald C. Read

Research output: Contribution to journal › Article › peer-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 language	English (US)
Pages (from-to)	167-172
Number of pages	6
Journal	International Journal of Computer Mathematics
Volume	7
Issue number	3
DOIs	https://doi.org/10.1080/00207167908803169
State	Published - Jan 1 1979
Externally published	Yes

Keywords

Graph
graph generation
locally restricted graph
orderly algorithm

ASJC Scopus subject areas

Computer Science Applications
Computational Theory and Mathematics
Applied Mathematics

Access to Document

10.1080/00207167908803169

Cite this

@article{e25d6aafa7c84540b82f81c732396995,

title = "Orderly Algorithms for Graph Generation",

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.",

keywords = "Graph, graph generation, locally restricted graph, orderly algorithm",

author = "Colbourn, {Charles J.} and Read, {Ronald C.}",

year = "1979",

month = jan,

day = "1",

doi = "10.1080/00207167908803169",

language = "English (US)",

volume = "7",

pages = "167--172",

journal = "International Journal of Computer Mathematics",

issn = "0020-7160",

publisher = "Taylor and Francis Ltd.",

number = "3",

}

TY - JOUR

T1 - Orderly Algorithms for Graph Generation

AU - Colbourn, Charles J.

AU - Read, Ronald C.

PY - 1979/1/1

Y1 - 1979/1/1

N2 - 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.

AB - 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.

KW - Graph

KW - graph generation

KW - locally restricted graph

KW - orderly algorithm

UR - http://www.scopus.com/inward/record.url?scp=0018768027&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0018768027&partnerID=8YFLogxK

U2 - 10.1080/00207167908803169

DO - 10.1080/00207167908803169

M3 - Article

AN - SCOPUS:0018768027

SN - 0020-7160

VL - 7

SP - 167

EP - 172

JO - International Journal of Computer Mathematics

JF - International Journal of Computer Mathematics

IS - 3

ER -

Orderly Algorithms for Graph Generation

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this