{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:40:31Z","timestamp":1725896431003},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642102165"},{"type":"electronic","value":"9783642102172"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10217-2_32","type":"book-chapter","created":{"date-parts":[[2009,11,9]],"date-time":"2009-11-09T15:52:03Z","timestamp":1257781923000},"page":"324-333","source":"Crossref","is-referenced-by-count":5,"title":["On the Crossing Numbers of Cartesian Products of Stars and Graphs on Five Vertices"],"prefix":"10.1007","author":[{"given":"Mari\u00e1n","family":"Kle\u0161\u010d","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1002\/jgt.3190040203","volume":"4","author":"L.W. Beineke","year":"1980","unstructured":"Beineke, L.W., Ringeisen, R.D.: On the crossing numbers of products of cycles and graphs of order four. J. Graph Theory\u00a04, 145\u2013155 (1980)","journal-title":"J. Graph Theory"},{"key":"32_CR2","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/j.jctb.2006.06.003","volume":"97","author":"D. Bokal","year":"2007","unstructured":"Bokal, D.: On the crossing numbers of Cartesian products with paths. J.\u00a0Combin. Theory B\u00a097, 381\u2013384 (2007)","journal-title":"J.\u00a0Combin. Theory B"},{"key":"32_CR3","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1002\/jgt.20258","volume":"56","author":"D. Bokal","year":"2007","unstructured":"Bokal, D.: On the crossing numbers of Cartesian products with trees. J.\u00a0Graph Theory\u00a056, 287\u2013300 (2007)","journal-title":"J.\u00a0Graph Theory"},{"key":"32_CR4","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"M.R. Garey","year":"1983","unstructured":"Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM J. Algebraic and Discrete Methods\u00a04, 312\u2013316 (1983)","journal-title":"SIAM J. Algebraic and Discrete Methods"},{"key":"32_CR5","first-page":"14","volume":"39","author":"P. He","year":"2007","unstructured":"He, P., Huang, Y.: The crossing number of W 4 \u00d7S n . Journal of Zhengzhou University (Natural Science Edition)\u00a039, 14\u201318 (2007)","journal-title":"Journal of Zhengzhou University (Natural Science Edition)"},{"key":"32_CR6","unstructured":"Ho, P.T.: The crossing number of K 1,1,3,n . Ars Combinatoria (to appear)"},{"key":"32_CR7","doi-asserted-by":"publisher","first-page":"1634","DOI":"10.1016\/j.disc.2006.12.002","volume":"308","author":"Y. Huang","year":"2008","unstructured":"Huang, Y., Zhao, T.: The crossing number of K 1,4,n . Discrete Math.\u00a0308, 1634\u20131638 (2008)","journal-title":"Discrete Math."},{"key":"32_CR8","doi-asserted-by":"crossref","first-page":"225","DOI":"10.21136\/CPM.1982.118128","volume":"107","author":"S. Jendrol","year":"1982","unstructured":"Jendrol, S., \u0160\u010derbov\u00e1, M.: On the crossing numbers of S m \u00d7P n and S m \u00d7C n . \u010casopis pro p\u011bstov\u00e1n\u00ed matematiky\u00a0107, 225\u2013230 (1982)","journal-title":"\u010casopis pro p\u011bstov\u00e1n\u00ed matematiky"},{"key":"32_CR9","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/S0021-9800(70)80087-4","volume":"9","author":"D.J. Kleitman","year":"1970","unstructured":"Kleitman, D.J.: The crossing number of K 5,n . J.\u00a0Combin. Theory\u00a09, 315\u2013323 (1970)","journal-title":"J.\u00a0Combin. Theory"},{"key":"32_CR10","first-page":"113","volume":"41","author":"M. Kle\u0161\u010d","year":"1991","unstructured":"Kle\u0161\u010d, M.: On the crossing numbers of Cartesian products of stars and paths or cycles. Mathematica Slovaca\u00a041, 113\u2013120 (1991)","journal-title":"Mathematica Slovaca"},{"key":"32_CR11","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1002\/jgt.3190180608","volume":"18","author":"M. Kle\u0161\u010d","year":"1994","unstructured":"Kle\u0161\u010d, M.: The crossing numbers of products of paths and stars with 4-vertex graphs. J.\u00a0Graph Theory\u00a018, 605\u2013614 (1994)","journal-title":"J.\u00a0Graph Theory"},{"key":"32_CR12","first-page":"51","volume":"9","author":"M. Kle\u0161\u010d","year":"1996","unstructured":"Kle\u0161\u010d, M.: The crossing number of K 2,3 \u00d7P n and K 2,3 \u00d7S n . Tatra Mountains Math. Publ.\u00a09, 51\u201356 (1996)","journal-title":"Tatra Mountains Math. Publ."},{"key":"32_CR13","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s003730170042","volume":"17","author":"M. Kle\u0161\u010d","year":"2001","unstructured":"Kle\u0161\u010d, M.: On the crossing numbers of products of stars and graphs of order five. Graphs and Combinatorics\u00a017, 289\u2013294 (2001)","journal-title":"Graphs and Combinatorics"},{"key":"32_CR14","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/S0012-365X(00)00251-X","volume":"233","author":"M. Kle\u0161\u010d","year":"2001","unstructured":"Kle\u0161\u010d, M.: The crossing numbers of Cartesian products of paths with 5\u2013vertex graphs. Discrete Math.\u00a0233, 353\u2013359 (2001)","journal-title":"Discrete Math."},{"key":"32_CR15","doi-asserted-by":"crossref","first-page":"197","DOI":"10.7151\/dmgt.1272","volume":"25","author":"M. Kle\u0161\u010d","year":"2005","unstructured":"Kle\u0161\u010d, M.: Some crossing numbers of products of cycles. Discuss. Math. Graph Theory\u00a025, 197\u2013210 (2005)","journal-title":"Discuss. Math. Graph Theory"},{"key":"32_CR16","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/0095-8956(78)90014-X","volume":"24","author":"R.D. Ringeisen","year":"1978","unstructured":"Ringeisen, R.D., Beineke, L.W.: The crossing number of C 3 \u00d7C n . J. Combin. Theory\u00a024, 134\u2013136 (1978)","journal-title":"J. Combin. Theory"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10217-2_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,13]],"date-time":"2021-10-13T18:35:42Z","timestamp":1634150142000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10217-2_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642102165","9783642102172"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10217-2_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}