{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T19:15:38Z","timestamp":1649013338973},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2009,12,1]],"date-time":"2009-12-01T00:00:00Z","timestamp":1259625600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2009,12]]},"DOI":"10.1007\/s00373-010-0882-4","type":"journal-article","created":{"date-parts":[[2010,2,9]],"date-time":"2010-02-09T10:25:52Z","timestamp":1265711152000},"page":"825-839","source":"Crossref","is-referenced-by-count":5,"title":["On Defining Sets of Full Designs with Block Size Three"],"prefix":"10.1007","volume":"25","author":[{"given":"Diane","family":"Donovan","sequence":"first","affiliation":[]},{"given":"James","family":"Lefevre","sequence":"additional","affiliation":[]},{"given":"Mary","family":"Waterhouse","sequence":"additional","affiliation":[]},{"given":"Emine \u015eule","family":"Yaz\u0131c\u0131","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,2,10]]},"reference":[{"key":"882_CR1","first-page":"5","volume":"23","author":"S. Akbari","year":"2001","unstructured":"Akbari S., Maimani H.R., Maysoori Ch.: Minimal defining sets for full 2 \u2212 (v, 3, v \u2212 2) designs. Australas. J. Combin. 23, 5\u20138 (2001)","journal-title":"Australas. J. Combin."},{"key":"882_CR2","first-page":"55","volume":"8","author":"R.A.H. Gower","year":"1993","unstructured":"Gower R.A.H.: Minimal defining sets in a family of Steiner triple systems. Australas. J. Combin. 8, 55\u201373 (1993)","journal-title":"Australas. J. Combin."},{"key":"882_CR3","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0012-365X(02)00474-0","volume":"261","author":"B.D. Gray","year":"2003","unstructured":"Gray B.D., Mathon R., Moran T., Street A.P.: The spectrum of minimal defining sets of some Steiner systems. Discrete Math. 261, 277\u2013284 (2003)","journal-title":"Discrete Math."},{"key":"882_CR4","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1017\/S0004972700017883","volume":"41","author":"K. Gray","year":"1990","unstructured":"Gray K.: On the minimum number of blocks defining a design. Bull. Austral. Math. Soc. 41, 97\u2013112 (1990)","journal-title":"Bull. Austral. Math. Soc."},{"key":"882_CR5","first-page":"91","volume":"1","author":"K. Gray","year":"1990","unstructured":"Gray K.: Further results on smallest defining set of well known designs. Australas. J. Combin. 1, 91\u2013100 (1990)","journal-title":"Australas. J. Combin."},{"key":"882_CR6","first-page":"97","volume":"38","author":"K. Gray","year":"1990","unstructured":"Gray K.: Defining sets of single-transposition-free designs. Util. Math. 38, 97\u2013103 (1990)","journal-title":"Util. Math."},{"key":"882_CR7","first-page":"97","volume":"60","author":"K. Gray","year":"2007","unstructured":"Gray K., Street A.P.: On defining sets of full designs and of designs related to them. J. Combin. Math. Combin. Comput. 60, 97\u2013104 (2007)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"882_CR8","first-page":"91","volume":"76","author":"K. Gray","year":"2008","unstructured":"Gray K., Street A.P.: Constructing defining sets of full designs. Util. Math. 76, 91\u201399 (2008)","journal-title":"Util. Math."},{"key":"882_CR9","first-page":"382","volume-title":"CRC Handbook of Combinatorial Designs","author":"K. Gray","year":"2007","unstructured":"Gray K., Street A.P.: Defining Sets, Section IV.13 In: Colbourn C.J., Dinitz J.H. (eds). CRC Handbook of Combinatorial Designs, 2nd edn, pp. 382\u2013385. CRC Press, Boca Raton (2007)","edition":"2"},{"key":"882_CR10","first-page":"67","volume":"75","author":"G. Havas","year":"2008","unstructured":"Havas G., Lawrence J.L., Ramsay C., Street A.P., Yaz\u0131c\u0131 E.\u015e.: Defining set spectra for designs can have arbitrarily large gaps. Util. Math. 75, 67\u201381 (2008)","journal-title":"Util. Math."},{"key":"882_CR11","unstructured":"Koloto\u011flu, E.: A new algorithm for finding the complete list of minimal defining sets of t-designs, Masters Thesis, Ko\u00e7 University, July 2007"},{"key":"882_CR12","doi-asserted-by":"crossref","unstructured":"Yaz\u0131c\u0131, E.\u015e., Koloto\u011flu, E.: On minimal defining sets of full designs and self-complementary designs, and a new algorithm for finding defining sets of t-designs, Graphs Combin. (2010) (to appear)","DOI":"10.1007\/s00373-010-0892-2"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0882-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-010-0882-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0882-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:29Z","timestamp":1559055509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-010-0882-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12]]},"references-count":12,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2009,12]]}},"alternative-id":["882"],"URL":"https:\/\/doi.org\/10.1007\/s00373-010-0882-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12]]}}}