{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T02:54:14Z","timestamp":1774925654246,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,7,18]],"date-time":"2015-07-18T00:00:00Z","timestamp":1437177600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s10623-015-0110-6","type":"journal-article","created":{"date-parts":[[2015,7,17]],"date-time":"2015-07-17T07:11:23Z","timestamp":1437117083000},"page":"421-433","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Hamiltonicity and cycle extensions in 0-block-intersection graphs of balanced incomplete block designs"],"prefix":"10.1007","volume":"80","author":[{"given":"Jason T.","family":"LeGrow","sequence":"first","affiliation":[]},{"given":"David A.","family":"Pike","sequence":"additional","affiliation":[]},{"given":"Jonathan","family":"Poulin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,18]]},"reference":[{"key":"110_CR1","doi-asserted-by":"crossref","unstructured":"Abueida A.A., Pike D.A.: Cycle extensions in BIBD block-intersection graphs. J. Comb. Des. 21, 303\u2013310 (2013).","DOI":"10.1002\/jcd.21328"},{"key":"110_CR2","doi-asserted-by":"crossref","unstructured":"Abueida A.A., Sritharan R.: Cycle extendability and Hamiltonian cycles in chordal graph classes. SIAM J. Discret. Math. 20(3), 669\u2013681 (2006).","DOI":"10.1137\/S0895480104441267"},{"key":"110_CR3","doi-asserted-by":"crossref","unstructured":"Alspach B., Hare D.: Edge-pancyclic block-intersection graphs. Discret. Math. 97, 17\u201324 (1991).","DOI":"10.1016\/0012-365X(91)90417-Z"},{"key":"110_CR4","doi-asserted-by":"crossref","unstructured":"Alspach B., Heinrich K., Mohar B.: A note on Hamilton cycles in block-intersection graphs. Finite Geom. Comb. Des.-Contemp. Math. 111, 1\u20134 (1990).","DOI":"10.1090\/conm\/111\/1079733"},{"key":"110_CR5","doi-asserted-by":"crossref","unstructured":"Case G.A., Pike D.A.: Pancyclic PBD block-intersection graphs. Discret. Math. 308, 896\u2013900 (2008).","DOI":"10.1016\/j.disc.2007.07.031"},{"key":"110_CR6","doi-asserted-by":"crossref","unstructured":"Chen G., Faudree R.J., Gould R.J., Jacobson M.S.: Cycle extendability of Hamiltonian interval graphs. SIAM J. Discret. Math. 20(3), 682\u2013689 (2006).","DOI":"10.1137\/S0895480104441450"},{"key":"110_CR7","doi-asserted-by":"crossref","unstructured":"Chv\u00e1tal V., Erd\u0151s P.: A note on Hamiltonian circuits. Discret. Math. 2, 111\u2013113 (1972).","DOI":"10.1016\/0012-365X(72)90079-9"},{"key":"110_CR8","doi-asserted-by":"crossref","unstructured":"Cohen M.B., Colbourn C.J.: Optimal and pessimal orderings of Steiner triple systems in disk arrays. Theor. Comput. Sci. 297, 103\u2013117 (2003).","DOI":"10.1016\/S0304-3975(02)00634-5"},{"key":"110_CR9","doi-asserted-by":"crossref","unstructured":"Dewar M., Stevens B.: Ordering Block Designs: Gray Codes, Universal Cycles, and Configuration Orderings. Springer, New York (2012).","DOI":"10.1007\/978-1-4614-4325-4"},{"key":"110_CR10","doi-asserted-by":"crossref","unstructured":"Dirac G.A.: In abstrakten Graphen vorhandene vollst\u00e4ndige 4-Graphen und ihre Unterteilungen. Math. Nachr. 22, 61\u201385 (1960).","DOI":"10.1002\/mana.19600220107"},{"key":"110_CR11","doi-asserted-by":"crossref","unstructured":"Fisher R.A.: An examination of the different possible solutions of a problem in incomplete blocks. Ann. Eugen. 10, 52\u201375 (1940).","DOI":"10.1111\/j.1469-1809.1940.tb02237.x"},{"key":"110_CR12","doi-asserted-by":"crossref","unstructured":"Ford L.R., Fulkerson D.R.: Maximal flow through graphs. Can. J. Math. 8, 399\u2013404 (1956).","DOI":"10.4153\/CJM-1956-045-5"},{"key":"110_CR13","doi-asserted-by":"crossref","unstructured":"Hare D.R.: Cycles in the block-intersection graph of pairwise balanced designs. Discret. Math. 137, 211\u2013221 (1995).","DOI":"10.1016\/0012-365X(93)E0140-Y"},{"key":"110_CR14","doi-asserted-by":"crossref","unstructured":"Hendry G.R.T.: Extending cycles in graphs. Discret. Math. 85, 59\u201372 (1990).","DOI":"10.1016\/0012-365X(90)90163-C"},{"key":"110_CR15","unstructured":"Hor\u00e1k P., Rosa A.: Decomposing Steiner triple systems into small configurations. Ars Comb. 26, 91\u2013105 (1988)."},{"key":"110_CR16","doi-asserted-by":"crossref","unstructured":"Hor\u00e1k P., Pike D.A., Raines M.E.: Hamilton cycles in block-intersection graphs of triple systems. J. Comb. Des. 7, 243\u2013246 (1999).","DOI":"10.1002\/(SICI)1520-6610(1999)7:4<243::AID-JCD2>3.0.CO;2-A"},{"key":"110_CR17","doi-asserted-by":"crossref","unstructured":"Jesso A.T., Pike D.A., Shalaby N.: Hamilton cycles in restricted block-intersection graphs. Des. Codes Cryptogr. 61, 345\u2013353 (2011).","DOI":"10.1007\/s10623-010-9483-8"},{"key":"110_CR18","doi-asserted-by":"crossref","unstructured":"Jiang T.: Planar Hamiltonian chordal graphs are cycle extendable. Discret. Math. 257, 441\u2013444 (2002).","DOI":"10.1016\/S0012-365X(02)00505-8"},{"key":"110_CR19","doi-asserted-by":"crossref","unstructured":"Karp R.M.: Reducibility among combinatorial problems. In: Proceedings of Symposium on the Complexity of Computer Applications, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, pp. 85\u2013103. Plenum, New York (1972).","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"110_CR20","doi-asserted-by":"crossref","unstructured":"Lafond M., Seamone B.: Hamiltonian chordal graphs are not cycle extendible. SIAM J. Discret. Math. 29(2), 877\u2013887 (2015).","DOI":"10.1137\/13094551X"},{"key":"110_CR21","unstructured":"Luther R.D., Pike D.A.: Cycle extensions in PBD block-intersection graphs. Ars Combinatoria (in press)."},{"key":"110_CR22","doi-asserted-by":"crossref","unstructured":"Mamut A., Pike D.A., Raines M.E.: Pancyclic BIBD block-intersection graphs. Discret. Math. 284, 205\u2013208 (2004).","DOI":"10.1016\/j.disc.2003.11.033"},{"key":"110_CR23","unstructured":"Nash-Williams C.St.J.A.: Edge-disjoint Hamiltonian circuits in graphs with vertices of large valency. In: Mirsky L. (ed.) Studies in Pure Mathematics, pp. 157\u2013183. Academic Press, London (1971)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0110-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-015-0110-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0110-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:58:40Z","timestamp":1559231920000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-015-0110-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,18]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["110"],"URL":"https:\/\/doi.org\/10.1007\/s10623-015-0110-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,18]]}}}