Orderly algorithms for graph generation

DOI10.1080/00207167908803169zbMath0418.05046OpenAlexW2007692825MaRDI QIDQ3208699

Ronald C. Read, Charles J. Colbourn

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

orderly algorithmgraph generationlocally restricted graph

Mathematics Subject Classification ID

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

Related Items

Steiner triple systems of order 19 with nontrivial automorphism group, The spectrum of support sizes for threefold triple systems, The fine structure of threefold triple systems: \(v\equiv 1 \text{ or }3\pmod 6\), 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, An orderly algorithm and some applications in finite geometry, The size distribution for Markov equivalence classes of acyclic digraph models., On the construction and enumeration of Hamiltonian graphs

Cites Work

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