Isomorph-Free Exhaustive Generation

We describe a very general technique for generating families of combinatorial objects without isomorphs. It applies to almost any class of objects for which an inductive construction process exists. In one form of our technique, no explicit isomorphism testing is required. In the other form, isomorph testing is restricted to within small subsets of the entire set of objects. A variety of different examples are presented, including the generation of graphs with some hereditary property, the generation of Latin rectangles and the generation of balanced incomplete block designs. The technique can also be used to perform unbiased statistical analysis, including approximate counting, of sets of objects too large to generate exhaustively. Note. This file approximately matches the published version in J. Algorithms, 26 (1998) 306–324, except for one corrected value in Table 2 and the erratum noted in Section 7.

• Type: Journal
• Year: 1998
• Where: JAL
• Authors: Brendan D. McKay
• Keywords: Combinatorial Objects, Explicit Isomorphism Testing, Inductive Construction Process, JAL 1998