{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T05:12:23Z","timestamp":1723007543132},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,6,16]],"date-time":"2012-06-16T00:00:00Z","timestamp":1339804800000},"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":[[2013,7]]},"DOI":"10.1007\/s00373-012-1174-y","type":"journal-article","created":{"date-parts":[[2012,6,18]],"date-time":"2012-06-18T05:28:54Z","timestamp":1339997334000},"page":"735-746","source":"Crossref","is-referenced-by-count":1,"title":["Silver Block Intersection Graphs of Steiner 2-Designs"],"prefix":"10.1007","volume":"29","author":[{"given":"A.","family":"Ahadi","sequence":"first","affiliation":[]},{"given":"Nazli","family":"Besharati","sequence":"additional","affiliation":[]},{"given":"E. S.","family":"Mahmoodian","sequence":"additional","affiliation":[]},{"given":"M.","family":"Mortezaeefar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,6,16]]},"reference":[{"issue":"1\u20133","key":"1174_CR1","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0012-365X(91)90417-Z","volume":"97","author":"B. Alspach","year":"1991","unstructured":"Alspach B., Hare D.: Edge-pancyclic block-intersection graphs. Discrete Math. 97(1\u20133), 17\u201324 (1991)","journal-title":"Discrete Math."},{"key":"1174_CR2","doi-asserted-by":"crossref","unstructured":"Alspach, B., Heinrich, K., Mohar, B.: A note on Hamilton cycles in block-intersection graphs. In: Finite Geometries and Combinatorial Designs (Lincoln, NE, 1987). Contemporary Mathematics, vol. 111, pp. 1\u20134. American Mathematical Society, Providence (1990)","DOI":"10.1090\/conm\/111\/1079733"},{"key":"1174_CR3","doi-asserted-by":"crossref","unstructured":"Amini, O., Esperet, L., van den Heuvel, J.: A unified approach to distance-two colouring of planar graphs. In: SODA \u201909: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 273\u2013282. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2009)","DOI":"10.1137\/1.9781611973068.31"},{"key":"1174_CR4","unstructured":"Behzad, M., Mahmoodian, E.S.: Graphs versus designs\u2014a quasisurvey. In: Graph Theory, Combinatorics, and Applications, vol. 1 (Kalamazoo, MI, 1988). Wiley-Interscience Publication, pp. 125\u2013142. Wiley, New York (1991)"},{"key":"1174_CR5","unstructured":"Colbourn, C.J., Dinitz, J.H. (eds.): Handbook of Combinatorial Designs. Discrete Mathematics and Its Applications (Boca Raton), 2nd edn. Chapman & Hall\/CRC, Boca Raton (2007)"},{"key":"1174_CR6","doi-asserted-by":"crossref","unstructured":"Donovan, D., Mahmoodian, E.S., Ramsay, C., Street, A.P.: Defining sets in combinatorics: a survey. In: Surveys in Combinatorics, 2003 (Bangor). London Mathematical Society Lecture Note Series, vol. 307, pp. 115\u2013174. Cambridge University Press, Cambridge (2003)","DOI":"10.1017\/CBO9781107359970.006"},{"issue":"5","key":"1174_CR7","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/s00373-008-0799-3","volume":"24","author":"M. Ghebleh","year":"2008","unstructured":"Ghebleh M., Goddyn L.A., Mahmoodian E.S., Verdian-Rizi M.: Silver cubes. Graphs Combin. 24(5), 429\u2013442 (2008)","journal-title":"Graphs Combin."},{"issue":"1\u20133","key":"1174_CR8","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0012-365X(93)E0140-Y","volume":"137","author":"D.R. Hare","year":"1995","unstructured":"Hare D.R.: Cycles in the block-intersection graph of pairwise balanced designs. Discrete Math. 137(1\u20133), 211\u2013221 (1995)","journal-title":"Discrete Math."},{"issue":"1","key":"1174_CR9","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF01389350","volume":"3","author":"D.R. Hare","year":"1993","unstructured":"Hare D.R., McCuaig W.: The connectivity of the block-intersection graphs of designs. Des. Codes Cryptogr. 3(1), 5\u20138 (1993)","journal-title":"Des. Codes Cryptogr."},{"issue":"4","key":"1174_CR10","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1002\/(SICI)1520-6610(1999)7:4<243::AID-JCD2>3.0.CO;2-A","volume":"7","author":"P. Hor\u00e1k","year":"1999","unstructured":"Hor\u00e1k P., Pike D.A., Raines M.E.: Hamilton cycles in block-intersection graphs of triple systems. J. Combin. Des. 7(4), 243\u2013246 (1999)","journal-title":"J. Combin. Des."},{"key":"1174_CR11","doi-asserted-by":"crossref","unstructured":"Kant, G., van Leeuwen, J.: The file distribution problem for processor networks. In: SWAT 90 (Bergen, 1990). Lecture Notes in Computer Science, vol. 447, pp. 48\u201359. Springer, Berlin (1990)","DOI":"10.1007\/3-540-52846-6_77"},{"key":"1174_CR12","unstructured":"Kant, G., van Leeuwen, J.: Strong colorings of graphs (1990). http:\/\/igitur-archive.library.uu.nl\/math\/2006-1214-202846\/UUindex.html"},{"issue":"2\u20133","key":"1174_CR13","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1016\/j.disc.2006.11.059","volume":"308","author":"F. Kramer","year":"2008","unstructured":"Kramer F., Kramer H.: A survey on the distance-colouring of graphs. Discrete Math. 308(2\u20133), 422\u2013426 (2008)","journal-title":"Discrete Math."},{"key":"1174_CR14","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511987045","volume-title":"A Course in Combinatorics, 2nd edn","author":"J.H. Lint van","year":"2001","unstructured":"van Lint J.H., Wilson R.M.: A Course in Combinatorics, 2nd edn. Cambridge University Press, Cambridge (2001)"},{"key":"1174_CR15","first-page":"48","volume":"28","author":"M. Mahdian","year":"2000","unstructured":"Mahdian M., Mahmoodian E.S.: The roots of an IMO97 problem. Bull. Inst. Combin. Appl. 28, 48\u201354 (2000)","journal-title":"Bull. Inst. Combin. Appl."},{"issue":"1\u20133","key":"1174_CR16","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/j.disc.2003.11.033","volume":"284","author":"A. Mamut","year":"2004","unstructured":"Mamut A., Pike D.A., Raines M.E.: Pancyclic BIBD block-intersection graphs. Discrete Math. 284(1\u20133), 205\u2013208 (2004)","journal-title":"Discrete Math."},{"key":"1174_CR17","first-page":"143","volume":"51","author":"D.A. Pike","year":"1999","unstructured":"Pike D.A.: Hamilton decompositions of block-intersection graphs of Steiner triple systems. Ars Combin. 51, 143\u2013148 (1999)","journal-title":"Ars Combin."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1174-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1174-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1174-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,29]],"date-time":"2019-06-29T22:23:16Z","timestamp":1561846996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1174-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,16]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["1174"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1174-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6,16]]}}}