{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:34:36Z","timestamp":1753886076870},"reference-count":21,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1981,7,1]],"date-time":"1981-07-01T00:00:00Z","timestamp":362793600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11704,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1981,7]]},"DOI":"10.1016\/0166-218x(81)90012-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:34Z","timestamp":1027640614000},"page":"155-162","source":"Crossref","is-referenced-by-count":10,"title":["Concerning the complexity of deciding isomorphism of block designs"],"prefix":"10.1016","volume":"3","author":[{"given":"Marlene J.","family":"Colbourn","sequence":"first","affiliation":[]},{"given":"Charles J.","family":"Colbourn","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(81)90012-3_BIB1","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1137\/0209018","article-title":"On the complexity of canonical labelling of strongly regular graphs","volume":"9","author":"Babai","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(81)90012-3_BIB2","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1137\/0209047","article-title":"Random graph isomorphism","volume":"9","author":"Babai","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(81)90012-3_BIB3","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/0166-218X(81)90012-3_BIB4","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1137\/0207023","article-title":"Isomorphism testing for graphs, semigroups, and finite automata are polynomially equivalent problems","volume":"7","author":"Booth","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(81)90012-3_BIB5","series-title":"Technical Report CS-77\/04","article-title":"Problems polynomially equivalent to graph isomorphism","author":"Booth","year":"1979"},{"key":"10.1016\/0166-218X(81)90012-3_BIB6","series-title":"Technical Report 123\/78","article-title":"A bibliography of the graph isomorphism problem","author":"Colbourn","year":"1978"},{"key":"10.1016\/0166-218X(81)90012-3_BIB7","first-page":"153","article-title":"Isomorphism problems involving self-complementary graphs and tournaments","author":"Colbourn","year":"1978","journal-title":"Proceedings of the Eighth Manitoba Conference on Numerical Mathematics and Computing"},{"key":"10.1016\/0166-218X(81)90012-3_BIB8","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/1008605.1008608","article-title":"Graph isomorphism and self-complementary graphs","volume":"10","author":"Colbourn","year":"1978","journal-title":"SIGACT News"},{"key":"10.1016\/0166-218X(81)90012-3_BIB9","first-page":"289","article-title":"An analysis technique for Steiner triple systems","author":"Colbourn","year":"1979","journal-title":"Proc. Tenth Southeastern Conference on Combinatorics, Graph Theory, and Computing"},{"key":"10.1016\/0166-218X(81)90012-3_BIB10","series-title":"Ph.D. Thesis","article-title":"Graph isomorphism","author":"Corneil","year":"1968"},{"key":"10.1016\/0166-218X(81)90012-3_BIB11","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1137\/0209025","article-title":"A theoretical analysis of various heuristics for the graph isomorphism problem","volume":"9","author":"Corneil","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(81)90012-3_BIB12","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1090\/S0002-9939-1972-0295928-2","article-title":"Constructions of disjoint Steiner triple systems","volume":"32","author":"Doyen","year":"1972","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/0166-218X(81)90012-3_BIB13","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0012-365X(75)90040-0","article-title":"Balanced incomplete block designs and related designs","volume":"11","author":"Hanani","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(81)90012-3_BIB14","first-page":"365","article-title":"Probabilistic analysis of a canonical numbering algorithm for graphs","author":"Karp","year":"1978","journal-title":"Proc. AMS Symposium on the Relation between Combinatories and Other Branches of Mathematics"},{"key":"10.1016\/0166-218X(81)90012-3_BIB15","article-title":"The beacon set approach to graph isomorphism","author":"Lipton","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(81)90012-3_BIB16","first-page":"499","article-title":"Sample graphs for graph isomorphism testing","author":"Mathon","year":"1978","journal-title":"Proc. Ninth Southeast Conference on Combinatorics, Graph Theory, and Computing"},{"key":"10.1016\/0166-218X(81)90012-3_BIB17","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/800133.804331","article-title":"On the nlogn isomorphism technique","author":"Miller","year":"1978","journal-title":"Proc. Tenth Annual ACM Symposium on the Theory of Computing"},{"key":"10.1016\/0166-218X(81)90012-3_BIB18","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1002\/jgt.3190010410","article-title":"The graph isomorphism disease","volume":"1","author":"Read","year":"1977","journal-title":"J. Graph Theory"},{"key":"10.1016\/0166-218X(81)90012-3_BIB19","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1515\/crll.1859.56.326","article-title":"Ueber eine Steinersche combinatorische Aufgabe w\u00e9lche im 45sten Bande dieses Journals Seite 181 gestellt worden ist","volume":"56","author":"Reiss","year":"1859","journal-title":"J. Reine Angew. Math."},{"issue":"A","key":"10.1016\/0166-218X(81)90012-3_BIB20","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0097-3165(75)90041-2","article-title":"A theorem on the maximal number of disjoint Steiner triple systems","volume":"18","author":"Rosa","year":"1975","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/0166-218X(81)90012-3_BIB21","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0012-365X(73)90101-5","article-title":"On the maximal number of disjoint Steiner triple systems","volume":"6","author":"Teirlinck","year":"1973","journal-title":"Discrete Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X81900123?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X81900123?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T02:25:03Z","timestamp":1555122303000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X81900123"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,7]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1981,7]]}},"alternative-id":["0166218X81900123"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(81)90012-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1981,7]]}}}