{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T00:20:56Z","timestamp":1758846056071,"version":"3.44.0"},"reference-count":29,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100007292","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007292","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Mathematics and Computation"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1016\/j.amc.2020.125075","type":"journal-article","created":{"date-parts":[[2020,3,3]],"date-time":"2020-03-03T17:33:49Z","timestamp":1583256829000},"page":"125075","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["The crossing number of <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" altimg=\"si5.svg\"><mml:mrow><mml:msub><mml:mi>K<\/mml:mi><mml:mrow><mml:mn>5<\/mml:mn><mml:mo>,<\/mml:mo><mml:mi>n<\/mml:mi><mml:mo>+<\/mml:mo><mml:mn>1<\/mml:mn><\/mml:mrow><\/mml:msub><mml:mrow><mml:mo>\u2216<\/mml:mo><mml:mi>e<\/mml:mi><\/mml:mrow><\/mml:mrow><\/mml:math>"],"prefix":"10.1016","volume":"376","author":[{"given":"Yuanqiu","family":"Huang","sequence":"first","affiliation":[]},{"given":"Yuxi","family":"Wang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.amc.2020.125075_bib0001","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/j.jctb.2006.06.003","article-title":"On the crossing numbers of cartesian procucts with paths","volume":"97","author":"Bokal","year":"2007","journal-title":"J. Combin. Theory Ser.B"},{"issue":"2","key":"10.1016\/j.amc.2020.125075_bib0002","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1002\/jgt.20470","article-title":"Infinite families of crossing-critical graphs with prescribed average degree and crossing number","volume":"65","author":"Bokal","year":"2010","journal-title":"J. Graph Theory"},{"issue":"2","key":"10.1016\/j.amc.2020.125075_bib0003","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/jgt.3190040203","article-title":"On the crossing numbers of products of cycles and graphs of order four","volume":"4","author":"W. Beineke","year":"2010","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.amc.2020.125075_sbref0004","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/978-3-540-77537-9_5","article-title":"Improvement on the decay of crossing numbers","volume":"4875","author":"\u010cern\u00fd","year":"2008","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/j.amc.2020.125075_bib0005","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/j.jctb.2012.11.001","article-title":"Zarankiewicz\u2019s conjecture is finite for each fixed m","volume":"103","author":"Christian","year":"2013","journal-title":"J.Combin. Theory Ser.B"},{"key":"10.1016\/j.amc.2020.125075_bib0006","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1080\/00029890.1973.11993230","article-title":"Crossing number problems","volume":"80","author":"Erd\u00f6s","year":"1973","journal-title":"Am.Math.Month"},{"year":"1969","series-title":"Graph Theory","author":"Harary","key":"10.1016\/j.amc.2020.125075_bib0007"},{"key":"10.1016\/j.amc.2020.125075_bib0008","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.jctb.2007.03.005","article-title":"On the decay of crossing numbers","volume":"98","author":"Fox","year":"2008","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.amc.2020.125075_bib0009","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1137\/0604033","article-title":"Crossing number is NP-complete","volume":"4","author":"R. Garey","year":"1983","journal-title":"SIAM J.Algebraic. Discrete Methods"},{"key":"10.1016\/j.amc.2020.125075_bib0010","first-page":"437","article-title":"Crossing numbers of nearly complete graphs and nearly complete bipartite graphs","volume":"121","author":"Chia","year":"2015","journal-title":"Ars Combinatoria"},{"key":"10.1016\/j.amc.2020.125075_bib0011","first-page":"225","article-title":"On the crossing numbers of sm\u25a1pn and sm\u25a1cn","volume":"107","author":"Jendro\u013e","year":"1982","journal-title":"J. \u010cas. Pest. Mat."},{"key":"10.1016\/j.amc.2020.125075_bib0012","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/S0021-9800(70)80087-4","article-title":"The crossing number of k5,n","volume":"9","author":"J. Kleitman","year":"1970","journal-title":"J.Combin. Theory"},{"issue":"1","key":"10.1016\/j.amc.2020.125075_bib0013","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0095-8956(76)90032-0","article-title":"A note on the parity of the number of crossings of a graph","volume":"21","author":"J. Kleitman","year":"1976","journal-title":"J.Combin. Theory Ser. B"},{"issue":"6","key":"10.1016\/j.amc.2020.125075_bib0014","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1002\/jgt.3190180608","article-title":"The crossing numbers of products of path and stars with 4-vertex graphs","volume":"18","author":"Kle\u0161\u010d","year":"1994","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.amc.2020.125075_bib0015","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/j.endm.2007.01.049","article-title":"The join of graphs and crossing numbers","volume":"28","author":"Kle\u0161\u010d","year":"2007","journal-title":"Electron. Notes Discrete Math."},{"issue":"9","key":"10.1016\/j.amc.2020.125075_bib0016","doi-asserted-by":"crossref","first-page":"1475","DOI":"10.1016\/j.disc.2009.08.018","article-title":"The crossing numbers of join of the special graph on six vertices with path and cycle","volume":"310","author":"Kle\u0161\u010d","year":"2010","journal-title":"Discrete Math."},{"key":"10.1016\/j.amc.2020.125075_bib0017","doi-asserted-by":"crossref","first-page":"321","DOI":"10.7151\/dmgt.1548","article-title":"The crossing numbers of join products of paths with graphs of order four","volume":"31","author":"Kle\u0161\u010d","year":"2011","journal-title":"Discuss. Math. Graph Theory"},{"key":"10.1016\/j.amc.2020.125075_bib0018","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1007\/978-3-642-28212-6_15","article-title":"The crossing numbers of join of paths and cycles with two graphs of order five","volume":"7125","author":"Kle\u0161\u010d","year":"2012","journal-title":"Math. Model. Comput. Sci. Springer, Lect. Notes in Comput. Sci."},{"key":"10.1016\/j.amc.2020.125075_bib0019","doi-asserted-by":"crossref","first-page":"399","DOI":"10.7151\/dmgt.1957","article-title":"On the crossing numbers of cartesian products of wheels and trees","volume":"37","author":"Kle\u0161\u010d","year":"2017","journal-title":"Discuss. Math. Graph Theory"},{"issue":"2","key":"10.1016\/j.amc.2020.125075_bib0020","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1002\/jgt.20249","article-title":"The crossing number of k11 is 100","volume":"56","author":"Pan","year":"2007","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.amc.2020.125075_bib0021","first-page":"194","article-title":"Thirteen problems on crossing numbers","volume":"9","author":"Pach","year":"2000","journal-title":"Geombinatorics"},{"key":"10.1016\/j.amc.2020.125075_bib0022","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1006\/jctb.1993.1038","article-title":"Minimal graphs with crossing number at least k","volume":"58","author":"B. Richter","year":"1993","journal-title":"J. Combin. Theory Ser.B"},{"key":"10.1016\/j.amc.2020.125075_bib0023","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1006\/jctb.1999.1943","article-title":"On the crossing number result of richter and thomassen","volume":"70","author":"Salazar","year":"2000","journal-title":"J.Combin. Theory Ser.B"},{"key":"10.1016\/j.amc.2020.125075_bib0024","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0012-365X(03)00317-0","article-title":"A successful concept for measuring non-planarity of graphs: the crossing number","volume":"276","author":"A. Szekely","year":"2004","journal-title":"Discrete Math."},{"year":"2011","series-title":"On the crossing number of a graph","author":"D. Ouyang","key":"10.1016\/j.amc.2020.125075_bib0025"},{"key":"10.1016\/j.amc.2020.125075_bib0026","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.disc.2014.03.011","article-title":"The crossing number of the cartesian product of paths with complete graphs","volume":"328","author":"D. Ouyang","year":"2014","journal-title":"Discrete Math."},{"issue":"3","key":"10.1016\/j.amc.2020.125075_bib0027","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1007\/s11464-016-0618-8","article-title":"Two recursive inequalities for crossing numbers of graphs","volume":"12","author":"D. Ouyang","year":"2017","journal-title":"Front. Math. China"},{"key":"10.1016\/j.amc.2020.125075_bib0028","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1002\/jgt.3190170602","article-title":"Cyclic-order graphs and zarankiewicz\u2019s crossing number conjecture","volume":"17","author":"R. Woodall","year":"1993","journal-title":"J.Graph Theory"},{"key":"10.1016\/j.amc.2020.125075_bib0029","doi-asserted-by":"crossref","first-page":"137","DOI":"10.4064\/fm-41-1-137-145","article-title":"On a problem of p.tur\u00e1n concerning graphs","volume":"41","author":"Zarankiewicz","year":"1954","journal-title":"J. Fund. Math."}],"container-title":["Applied Mathematics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300320300448?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300320300448?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T16:33:44Z","timestamp":1758818024000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0096300320300448"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7]]},"references-count":29,"alternative-id":["S0096300320300448"],"URL":"https:\/\/doi.org\/10.1016\/j.amc.2020.125075","relation":{},"ISSN":["0096-3003"],"issn-type":[{"type":"print","value":"0096-3003"}],"subject":[],"published":{"date-parts":[[2020,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The crossing number of","name":"articletitle","label":"Article Title"},{"value":"Applied Mathematics and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.amc.2020.125075","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2020 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"125075"}}