{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:32:44Z","timestamp":1725564764296},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540204527"},{"type":"electronic","value":"9783540398905"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39890-5_20","type":"book-chapter","created":{"date-parts":[[2010,9,3]],"date-time":"2010-09-03T21:16:57Z","timestamp":1283548617000},"page":"230-236","source":"Crossref","is-referenced-by-count":2,"title":["An Improved Upper Bound on the Crossing Number of the Hypercube"],"prefix":"10.1007","author":[{"given":"Luerbio","family":"Faria","sequence":"first","affiliation":[]},{"given":"Celina M. Herrera","family":"de Figueiredo","sequence":"additional","affiliation":[]},{"given":"Ondrej","family":"S\u00fdkora","sequence":"additional","affiliation":[]},{"given":"Imrich","family":"Vrt\u2019o","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/jgt.3190190113","volume":"19","author":"A.M. Dean","year":"1995","unstructured":"Dean, A.M., Richter, R.B.: The crossing number of C4 \u00d7 C4. J. Graph Theory\u00a019, 125\u2013129 (1995)","journal-title":"J. Graph Theory"},{"key":"20_CR2","volume-title":"Graph Drawing: Algorithms for Visualisations of Graphs","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for Visualisations of Graphs. Prentice Hall, New Jersey (1999)"},{"key":"20_CR3","first-page":"757","volume":"17","author":"R.B. Eggleton","year":"1970","unstructured":"Eggleton, R.B., Guy, R.P.: The crossing number of the n-cube. Notices AMS\u00a017, 757 (1970)","journal-title":"Notices AMS"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"52","DOI":"10.2307\/2319261","volume":"80","author":"P. Erd\u00f6s","year":"1973","unstructured":"Erd\u00f6s, P., Guy, R.P.: Crossing number problems. American Mathematical Monthly\u00a080, 52\u201358 (1973)","journal-title":"American Mathematical Monthly"},{"key":"20_CR5","first-page":"271","volume":"50","author":"L. Faria","year":"2000","unstructured":"Faria, L., Figueiredo, C.M.H.: On Eggleton and Guy\u2019s conjectured upper bound for the crossing number of the n-cube. Mathematica Slovaca\u00a050, 271\u2013287 (2000)","journal-title":"Mathematica Slovaca"},{"key":"20_CR6","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. Discrete Mathematics\u00a04, 312\u2013316 (1983)","journal-title":"SIAM J. Discrete Mathematics"},{"key":"20_CR7","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BFb0059432","volume-title":"Proc. Recent Trends in Graph Theory","author":"R.P. Guy","year":"1971","unstructured":"Guy, R.P.: Latest results on crossing numbers. In: TAPSOFT 1985 and CSE 1985. Lecture Notes in Mathematics, vol.\u00a0186, pp. 143\u2013156. Springer, New York (1971)"},{"key":"20_CR8","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"Harary, F.: Graph Theory. Addison Wesley, Reading (1969)"},{"key":"20_CR9","volume-title":"Complexity Issues in VLSI","author":"F.T. Leighton","year":"1983","unstructured":"Leighton, F.T.: Complexity Issues in VLSI. MIT Press, Cambridge (1983)"},{"key":"20_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00032","volume":"5","author":"A. Liebers","year":"2001","unstructured":"Liebers, A.: Planarizing graphs - a survey and annotated bibliography. J. Graph Algorithms and Applications\u00a05, 1\u201374 (2001)","journal-title":"J. Graph Algorithms and Applications"},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1002\/jgt.3190150109","volume":"15","author":"T. Madej","year":"1991","unstructured":"Madej, T.: Bounds for the crossing number of the n-cube. J. Graph Theory\u00a015, 81\u201397 (1991)","journal-title":"J. Graph Theory"},{"key":"20_CR12","unstructured":"Shahrokhi, F., S\u00fdkora, O., Sz\u00e9kely, L.A., Vrt\u2019o, I.: Crossing numbers: bounds and applications, in: Intuitive Geometry. In: B\u00e1r\u00e1ny, I., B\u00f6r\u00f6czky, K. (eds.) Bolyai Society Mathematical Studies 6, Akad\u00e9mia Kiad\u00f3, Budapest, pp. 179\u2013206 (1997)"},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BF01989746","volume":"33","author":"O. S\u00fdkora","year":"1993","unstructured":"S\u00fdkora, O., Vrt\u2019o, I.: On the crossing number of the hypercube and cube connected cycles. BIT\u00a033, 232\u2013237 (1993)","journal-title":"BIT"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39890-5_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T17:35:47Z","timestamp":1553016947000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39890-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540204527","9783540398905"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39890-5_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}