{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T22:16:21Z","timestamp":1648851381523},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2008,11,1]],"date-time":"2008-11-01T00:00:00Z","timestamp":1225497600000},"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":[[2008,11]]},"DOI":"10.1007\/s00373-008-0800-1","type":"journal-article","created":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T09:27:42Z","timestamp":1228123662000},"page":"597-604","source":"Crossref","is-referenced-by-count":1,"title":["The Crossing Number of C(8, 2)\u25a1P n"],"prefix":"10.1007","volume":"24","author":[{"given":"Zihan","family":"Yuan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tang","family":"Ling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuanqiu","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinwang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,12,2]]},"reference":[{"key":"800_CR1","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., Murty, M.S.R.: Graph Theory with Application. Am. Elsevier, New York, (1976)","DOI":"10.1007\/978-1-349-03521-2"},{"key":"800_CR2","doi-asserted-by":"crossref","unstructured":"Kle\u0161\u010d, M.: The crossing numbers of products of paths and stars with 4-vertex graphs. J. Graph Theory 18, 605\u2013614(1994)","DOI":"10.1002\/jgt.3190180608"},{"key":"800_CR3","doi-asserted-by":"crossref","unstructured":"Beineke, L.W., Ringeisen, R.D.: On the crossing numbers of products of cycles and graphs of order four. J. Graph Theory 4,145\u2013155 (1980)","DOI":"10.1002\/jgt.3190040203"},{"key":"800_CR4","doi-asserted-by":"crossref","unstructured":"Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM J. Alg. Disc. Meth. 4, 312\u2013316 (1983)","DOI":"10.1137\/0604033"},{"key":"800_CR5","unstructured":"Kle\u0161\u010d, M.: The crossing number of K 5 \u00d7 P n . Tatra Mount. Math. Public. 18, 63\u201368 (1999)"},{"key":"800_CR6","unstructured":"Lv, S., Huang, Y.: The crossing number of K 5\u00a0\u00d7 S n . J. Math. Res. Expos., in press (2007)"},{"key":"800_CR7","unstructured":"Liu,T., Liu, Y.: On the crossing Number of Circular Graphs. OR Transaction 24, 32\u201336 (1998)"},{"key":"800_CR8","unstructured":"Yuan, Z., Huang, Y.: The crossing number of K 2,2,2\u00a0\u00d7 P n and K 1,1,2,2\u00a0\u00d7\u00a0P n , submitted to Adv. math. (2007)"},{"key":"800_CR9","unstructured":"Zhou, Z., Huang, Y.: The crossing number of K 3,3\u00a0\u00d7\u00a0P n . J. Nat. Sci. Hunan Normal Univ. 30(1), 31\u201334 (2007)"},{"key":"800_CR10","unstructured":"Yuan, Z., Huang, Y.: The crossing number of C(7,2)\u00a0\u00d7\u00a0P n . Adv. Math. 2, 245\u2013253 (2008)"},{"key":"800_CR11","doi-asserted-by":"crossref","unstructured":"Peng, Y.H., Yiew, Y.C.: The crossing number of P(3,1)\u00a0\u00d7\u00a0P n . Discrete Math. 306, 1941\u20131946 (2006)","DOI":"10.1016\/j.disc.2006.03.058"},{"key":"800_CR12","doi-asserted-by":"crossref","unstructured":"Dean, A.M., Richter, R.B.: The Crossing Number of C 4\u00a0\u00d7 C 4. J. Graph Theory 19, 125\u201329 (1995)","DOI":"10.1002\/jgt.3190190113"},{"key":"800_CR13","doi-asserted-by":"crossref","unstructured":"Yang Y., Liu X., Liu J., Hao X.: The crossing number of C(n; {1, 3}). Discrete Math. 289, 107\u2013118 (2004)","DOI":"10.1016\/j.disc.2004.08.014"},{"key":"800_CR14","doi-asserted-by":"crossref","unstructured":"Ma, D., Ren, H., Lu, J.: The crossing number of the circular graph C(2m\u00a0+\u00a02, m). Discrete Math. 304, 88\u201393 (2005)","DOI":"10.1016\/j.disc.2005.04.018"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0800-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-008-0800-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0800-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:28Z","timestamp":1559055508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-008-0800-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11]]},"references-count":14,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2008,11]]}},"alternative-id":["800"],"URL":"https:\/\/doi.org\/10.1007\/s00373-008-0800-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11]]}}}