Orderly algorithms for graph generation

DOI10.1080/00207167908803169MaRDI QIDQ3208699zbMATH OpenOpenAlexFDO

Authors Charles J. Colbourn, Ronald C. Read

Publication date 1979

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207167908803169

zbMATH Keywords

graph generationlocally restricted graphorderly algorithm

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Graph theory (05C99) Algorithms in computer science (68W99)

Cites work

• Algorithm for generating graphs of a given partition
• On graphical partitions and planarity

Cited in

(9)

• The fine structure of threefold triple systems: \(v\equiv 1 \text{ or }3\pmod 6\)
• On the construction and enumeration of Hamiltonian graphs
• An orderly algorithm and some applications in finite geometry
• The size distribution for Markov equivalence classes of acyclic digraph models.
• Orderly generation of half regular symmetric designs via Rahilly families of pre-difference sets
• Tone rows and tropes
• On searching for small Kochen-Specker vector systems
• Steiner triple systems of order 19 with nontrivial automorphism group
• The spectrum of support sizes for threefold triple systems

This page was built for publication: Orderly algorithms for graph generation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3208699)