Orderly algorithms for graph generation

DOI10.1080/00207167908803169zbMATH Open0418.05046OpenAlexW2007692825MaRDI QIDQ3208699FDOQ3208699

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

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)

Cites Work

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

Cited In (9)

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

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)