On Cyclic Steiner 2-Designs

[1]  M. Reiss,et al.  Ueber eine Steinersche combinatorische Aufgabe, welche im 45sten Bande dieses Journals, Seite 181, gestellt worden ist. , 1859 .

[2]  Prince Camille de Polignac.  On a Problem in Combinations , 1866 .

[3]  E. Netto.  Zur Theorie der Tripelsysteme , 1893 .

[4]  E. H. Moore,et al.  Concerning triple systems , 1893 .

[5]  Henry S. White.  Triple-systems as transformations, and their paths among triads , 1913 .

[6]  F. N. Cole.  The triad systems of thirteen letters , 1913 .

[7]  Louise D. Cummings.  On a method of comparison for triple-systems , 1914 .

[8]  F N Cole,et al.  The Complete Enumeration of Triad Systems in 15 Elements. , 1917, Proceedings of the National Academy of Sciences of the United States of America.

[9]  Louise D. Cummings.  An undervalued Kirkman paper , 1918 .

[10]  Louise D. Cummings,et al.  Complete classification of the triad systems on fifteen elements , 1919 .

[11]  S. Bays.  Sur les systèmes cycliques de triples de Steiner , 1923 .

[12]  Sur les systèmes cycliques de triples de Steiner différents pour ${\rm N}$ premier (ou puissance de nombre premier) de la forme $6n + {\rm I}$ , 1925 .

[13]  S. Bays.  Sur les systèmes cycliques de triples de steiner différents pourN premier (ou puissance de nombre premier) de la forme 6n+1 (suite) , 1931 .

[14]  P. Lambossy.  Sur une manière de différencier les fonctions cycliques d'une forme donnée , 1931 .

[15]  Sur les systèmes cycliques de triples de Steiner différents pourN premier de la forme 6n+1 , 1932 .

[16]  Rose Peltesohn.  Eine Lösung der beiden Heffterschen Differenzenprobleme , 1939 .

[17]  R. C. Bose.  ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS , 1939 .

[18]  de Ng Dick Bruijn.  A combinatorial problem , 1946 .

[19]  R. H. Bruck.  DIFFERENCE SETS IN A FINITE GROUP , 1955 .

[20]  Marshall Hall,et al.  Determination of Steiner triple systems of order 15 , 1955 .

[21]  Marshall Hall,et al.  A survey of difference sets , 1956 .

[22]  Th. Skolem,et al.  On certain distributions of integers in pairs with given differences , 1957 .

[23]  Th. Skolem,et al.  Some Remarks on the Triple Systems of Steiner. , 1958 .

[24]  Roy O. Davies,et al.  On Langford’s Problem (II) , 1959, The Mathematical Gazette.

[25]  Haim Hanani,et al.  A Note on Steiner Triple Systems. , 1960 .

[26]  H. Hanani.  The Existence and Construction of Balanced Incomplete Block Designs , 1961 .

[27]  Edward S. O'keefe,et al.  Verification of a Conjecture of Th. Skolem. , 1961 .

[28]  James Turner.  Point-symmetric graphs with a prime number of points , 1967 .

[29]  V. E. Alekseev.  Skolem method of constructing cyclic Steiner triple systems , 1967 .

[30]  Jean Doyen.  Sur la croissance du nombre de systèmes triples de Steiner non lsomorphes , 1970 .

[31]  D. Ź. Djoković.  Isomorphism problem for a special class of graphs , 1970 .

[32]  B. Elspas,et al.  Graphs with circulant adjacency matrices , 1970 .

[33]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[34]  J. Doyen,et al.  On the number of non isomorphic Steiner triple systems , 1971 .

[35]  Richard M. Wilson,et al.  Nonisomorphic Steiner triple systems , 1974 .

[36]  Combinatorial structures in loops , 1974 .

[37]  Peter Blundell Gibbons,et al.  Computing techniques for the construction and analysis of block designs. , 1976 .

[38]  Derek G. Corneil,et al.  The graph isomorphism disease , 1977, J. Graph Theory.

[39]  Alexander Rosa,et al.  Steiner quadruple systems - a survey , 1978, Discret. Math..

[40]  R. Read.  Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations , 1978 .

[41]  Gary L. Miller,et al.  On the nlog n isomorphism technique (A Preliminary Report) , 1978, STOC.

[42]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[43]  Brian Alspach,et al.  Isomorphism of circulant graphs and digraphs , 1979, Discret. Math..

[44]  Charles J. Colbourn,et al.  Orderly algorithms for graph generation , 1979 .

[45]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[46]  Paul Camion.  Difference sets in elementary Abelian groups , 1979 .

[47]  Rudolf Mathon,et al.  A Note on the Graph Isomorphism counting Problem , 1979, Inf. Process. Lett..