{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:41:25Z","timestamp":1759333285618,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s00373-021-02423-5","type":"journal-article","created":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T10:07:05Z","timestamp":1643710025000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["The Crossing Numbers of Join of Special Disconnected Graph on Five Vertices with Discrete Graphs"],"prefix":"10.1007","volume":"38","author":[{"given":"Mari\u00e1n","family":"Kle\u0161\u010d","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2837-8879","authenticated-orcid":false,"given":"Michal","family":"Sta\u0161","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jana","family":"Petrillov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,2,1]]},"reference":[{"key":"2423_CR1","doi-asserted-by":"publisher","first-page":"143","DOI":"10.37193\/CJM.2018.02.03","volume":"34","author":"\u0160 Bere\u017en\u00fd","year":"2018","unstructured":"Bere\u017en\u00fd, \u0160, Sta\u0161, M.: Cyclic permutations and crossing numbers of join products of symmetric graph of order six. Carpathian J. Math. 34, 143\u2013155 (2018)","journal-title":"Carpathian J. Math."},{"key":"2423_CR2","doi-asserted-by":"publisher","first-page":"137","DOI":"10.37193\/CJM.2019.02.02","volume":"35","author":"\u0160 Bere\u017en\u00fd","year":"2019","unstructured":"Bere\u017en\u00fd, \u0160, Sta\u0161, M.: Cyclic permutations and crossing numbers of join products of two symmetric graphs of order six. Carpathian J. Math. 35, 137\u2013146 (2019)","journal-title":"Carpathian J. Math."},{"key":"2423_CR3","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.disopt.2007.05.006","volume":"5","author":"C Buchheim","year":"2008","unstructured":"Buchheim, C., Chimani, M., Ebner, D., Gutwenger, C., J\u00fcnger, M., Klau, G.W., Mutzel, P., Weiskircher, R.: A branch-and-cut approach to the crossing number problem. Discrete Optim. 5, 373\u2013388 (2008)","journal-title":"Discrete Optim."},{"doi-asserted-by":"crossref","unstructured":"Chimani, M., Mutzel, P., Bomze, I.: A new approach to exact crossing minimization. In: 16th Annual European Symposium on Algorithms 2008 Karlsruhe (ESA08), vol. 5193, pp. 284\u2013296. Springer\/LNCS, New York (2008)","key":"2423_CR4","DOI":"10.1007\/978-3-540-87744-8_24"},{"doi-asserted-by":"crossref","unstructured":"Chimani, M., Gutwenger, C., Mutzel, P.: Experiments on exact crossing minimization using column generation. ACM J. Exp. Algorithm. 14, 4.1-4.18 (2009)","key":"2423_CR5","DOI":"10.1145\/1498698.1564504"},{"key":"2423_CR6","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"MR Garey","year":"1983","unstructured":"Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM J. Algebraic. Discrete Methods 4, 312\u2013316 (1983)","journal-title":"SIAM J. Algebraic. Discrete Methods"},{"key":"2423_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.37236\/2777","volume":"21","author":"C Hern\u00e1ndez-V\u00e9lez","year":"2014","unstructured":"Hern\u00e1ndez-V\u00e9lez, C., Medina, C., Salazar, G.: The optimal drawing of $$K_{5, n}$$. Electron. J. Combin. 21, 1\u201329 (2014)","journal-title":"Electron. J. Combin."},{"key":"2423_CR8","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/S0021-9800(70)80087-4","volume":"9","author":"DJ Kleitman","year":"1970","unstructured":"Kleitman, D.J.: The crossing number of $$K_{5, n}$$. J. Combin. Theory 9, 315\u2013323 (1970)","journal-title":"J. Combin. Theory"},{"key":"2423_CR9","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 product of paths with 5-vertex graphs. Discrete Math. 28, 353\u2013359 (2001)","journal-title":"Discrete Math."},{"key":"2423_CR10","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/j.endm.2007.01.049","volume":"28","author":"M Kle\u0161\u010d","year":"2007","unstructured":"Kle\u0161\u010d, M.: The join of graphs and crossing numbers. Electron. Notes Discrete Math. 28, 349\u2013355 (2007)","journal-title":"Electron. Notes Discrete Math."},{"key":"2423_CR11","doi-asserted-by":"publisher","first-page":"1475","DOI":"10.1016\/j.disc.2009.08.018","volume":"310","author":"M Kle\u0161\u010d","year":"2010","unstructured":"Kle\u0161\u010d, M.: The crossing numbers of join of the special graph on six vertices with path and cycle. Discrete Math. 310, 1475\u20131481 (2010)","journal-title":"Discrete Math."},{"key":"2423_CR12","doi-asserted-by":"publisher","first-page":"321","DOI":"10.7151\/dmgt.1548","volume":"31","author":"M Kle\u0161\u010d","year":"2011","unstructured":"Kle\u0161\u010d, M., Schr\u00f6tter, \u0160: The crossing numbers of join products of paths with graphs of order four. Discuss. Math. Graph Theory 31, 321\u2013331 (2011)","journal-title":"Discuss. Math. Graph Theory"},{"doi-asserted-by":"crossref","unstructured":"Kle\u0161\u010d, M., Schr\u00f6tter, \u0160.: The crossing numbers of join of paths and cycles with two graphs of order five. Combin. Algorithms (Springer, LNCS) 7125, 160\u2013167 (2012)","key":"2423_CR13","DOI":"10.1007\/978-3-642-28212-6_15"},{"key":"2423_CR14","doi-asserted-by":"publisher","first-page":"339","DOI":"10.7151\/dmgt.1957","volume":"37","author":"M Kle\u0161\u010d","year":"2017","unstructured":"Kle\u0161\u010d, M., Petrillov\u00e1, J., Valo, M.: On the crossing numbers of Cartesian products of wheels and trees. Discuss. Math. Graph Theory 37, 339\u2013413 (2017)","journal-title":"Discuss. Math. Graph Theory"},{"key":"2423_CR15","first-page":"87","volume":"5","author":"VR Kulli","year":"2001","unstructured":"Kulli, V.R., Muddebihal, M.H.: Characterization of join graphs with crossing number zero. Far East J. Appl. Math. 5, 87\u201397 (2001)","journal-title":"Far East J. Appl. Math."},{"key":"2423_CR16","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1002\/jgt.3190170602","volume":"17","author":"DR Woodall","year":"1993","unstructured":"Woodall, D.R.: Cyclic-order graphs and Zarankiewicz\u2019s crossing number conjecture. J. Graph Theory 17, 657\u2013671 (1993)","journal-title":"J. Graph Theory"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02423-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-021-02423-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02423-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,23]],"date-time":"2022-03-23T14:35:32Z","timestamp":1648046132000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-021-02423-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,1]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["2423"],"URL":"https:\/\/doi.org\/10.1007\/s00373-021-02423-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2022,2,1]]},"assertion":[{"value":"19 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 August 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 September 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"35"}}