Orderly algorithms for generating restricted classes of graphs

Charles Colbourn, Ronald C. Read

Research output: Contribution to journalArticle

21 Citations (Scopus)

Abstract

Orderly algorithms for the generation of exhaustive lists of nonisomorphic graphs are discussed. The existence of orderly methods to generate the graphs with a given subgraph and without a given subgraph is established. This method can be used to list all the nonisomorphic subgraphs of a given graph, as well as to produce catalogs of Hamiltonian graphs, pancyclic graphs, degree‐constrained graphs, and other classes. A generalization of this method is given that can be used to generate lists of graphs with given girth, planar graphs, k‐colorable graphs, and k‐connected graphs, for example. Finally, these observations are employed to generate restricted classes of digraphs, notably acyclic digraphs and poset digraphs. The generation of poset digraphs is shown to supply a practical orderly method for producing a catalog of lattices. Similar observations concerning vertex addition generation methods allow one to improve on existing methods for the generation of catalog of interval and circle graphs.

Original languageEnglish (US)
Pages (from-to)187-195
Number of pages9
JournalJournal of Graph Theory
Volume3
Issue number2
DOIs
StatePublished - 1979
Externally publishedYes

Fingerprint

Graph in graph theory
Digraph
Subgraph
Poset
Pancyclic Graphs
Circle Graph
Acyclic Digraph
Hamiltonian Graph
Interval Graphs
Girth
Class
Planar graph
Vertex of a graph
Observation

ASJC Scopus subject areas

  • Geometry and Topology

Cite this

Orderly algorithms for generating restricted classes of graphs. / Colbourn, Charles; Read, Ronald C.

In: Journal of Graph Theory, Vol. 3, No. 2, 1979, p. 187-195.

Research output: Contribution to journalArticle

@article{369f88663c914ebcba16ea4897436529,
title = "Orderly algorithms for generating restricted classes of graphs",
abstract = "Orderly algorithms for the generation of exhaustive lists of nonisomorphic graphs are discussed. The existence of orderly methods to generate the graphs with a given subgraph and without a given subgraph is established. This method can be used to list all the nonisomorphic subgraphs of a given graph, as well as to produce catalogs of Hamiltonian graphs, pancyclic graphs, degree‐constrained graphs, and other classes. A generalization of this method is given that can be used to generate lists of graphs with given girth, planar graphs, k‐colorable graphs, and k‐connected graphs, for example. Finally, these observations are employed to generate restricted classes of digraphs, notably acyclic digraphs and poset digraphs. The generation of poset digraphs is shown to supply a practical orderly method for producing a catalog of lattices. Similar observations concerning vertex addition generation methods allow one to improve on existing methods for the generation of catalog of interval and circle graphs.",
author = "Charles Colbourn and Read, {Ronald C.}",
year = "1979",
doi = "10.1002/jgt.3190030210",
language = "English (US)",
volume = "3",
pages = "187--195",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "2",

}

TY - JOUR

T1 - Orderly algorithms for generating restricted classes of graphs

AU - Colbourn, Charles

AU - Read, Ronald C.

PY - 1979

Y1 - 1979

N2 - Orderly algorithms for the generation of exhaustive lists of nonisomorphic graphs are discussed. The existence of orderly methods to generate the graphs with a given subgraph and without a given subgraph is established. This method can be used to list all the nonisomorphic subgraphs of a given graph, as well as to produce catalogs of Hamiltonian graphs, pancyclic graphs, degree‐constrained graphs, and other classes. A generalization of this method is given that can be used to generate lists of graphs with given girth, planar graphs, k‐colorable graphs, and k‐connected graphs, for example. Finally, these observations are employed to generate restricted classes of digraphs, notably acyclic digraphs and poset digraphs. The generation of poset digraphs is shown to supply a practical orderly method for producing a catalog of lattices. Similar observations concerning vertex addition generation methods allow one to improve on existing methods for the generation of catalog of interval and circle graphs.

AB - Orderly algorithms for the generation of exhaustive lists of nonisomorphic graphs are discussed. The existence of orderly methods to generate the graphs with a given subgraph and without a given subgraph is established. This method can be used to list all the nonisomorphic subgraphs of a given graph, as well as to produce catalogs of Hamiltonian graphs, pancyclic graphs, degree‐constrained graphs, and other classes. A generalization of this method is given that can be used to generate lists of graphs with given girth, planar graphs, k‐colorable graphs, and k‐connected graphs, for example. Finally, these observations are employed to generate restricted classes of digraphs, notably acyclic digraphs and poset digraphs. The generation of poset digraphs is shown to supply a practical orderly method for producing a catalog of lattices. Similar observations concerning vertex addition generation methods allow one to improve on existing methods for the generation of catalog of interval and circle graphs.

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

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

U2 - 10.1002/jgt.3190030210

DO - 10.1002/jgt.3190030210

M3 - Article

AN - SCOPUS:0011686172

VL - 3

SP - 187

EP - 195

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 2

ER -