Orderly algorithms for graph generation
From MaRDI portal
Publication:3208699
Cites work
Cited in
(9)- The size distribution for Markov equivalence classes of acyclic digraph models.
- On the construction and enumeration of Hamiltonian graphs
- 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
- The spectrum of support sizes for threefold triple systems
- Steiner triple systems of order 19 with nontrivial automorphism group
- An orderly algorithm and some applications in finite geometry
- On searching for small Kochen-Specker vector systems
- Tone rows and tropes
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)