{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:08:40Z","timestamp":1725466120163},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540642756"},{"type":"electronic","value":"9783540697152"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054317","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T05:37:37Z","timestamp":1149658657000},"page":"141-150","source":"Crossref","is-referenced-by-count":2,"title":["The splitting number of the 4-cube"],"prefix":"10.1007","author":[{"given":"Luerbio","family":"Faria","sequence":"first","affiliation":[]},{"given":"Celina Miraglia Herrera","family":"de Figueiredo","sequence":"additional","affiliation":[]},{"given":"Candido Ferreira Xavier","family":"de Mendon\u00c7a Neto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,25]]},"reference":[{"key":"13_CR1","first-page":"97","volume":"118","author":"M. S. Anderson","year":"1996","unstructured":"M. S. Anderson, R. B. Richter and P. Rodney (1996). \u201cThe crossing number of C\n6\u00d7C\n6\u201d, Congressus Numerantium\n118, 97\u2013107.","journal-title":"Congressus Numerantium"},{"key":"13_CR2","unstructured":"M. S. Anderson, R. B. Richter and P. Rodney (1997). \u201cThe crossing number of C\n7\u00d7C\n7\u201d. Proc. 28th Southeastern Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Florida, USA."},{"key":"13_CR3","first-page":"21","volume":"88","author":"R. J. Cimikowski","year":"1992","unstructured":"R. J. Cimikowski (1992). \u201cGraph planarization and skewness\u201d, Congressus Numerantium, 88, 21\u201332.","journal-title":"Congressus Numerantium"},{"key":"13_CR4","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/jgt.3190190113","volume":"19","author":"A. M. Dean","year":"1995","unstructured":"A. M. Dean and R. B. Richter (1995). \u201cThe crossing number of C\n4\u00d7C\n4\u201d, Journal of Graph Theory\n19, 125\u2013129.","journal-title":"Journal of Graph Theory"},{"key":"13_CR5","unstructured":"P. Eades and C. F. X. Mendon\u00c7a (1993). \u201cHeuristics for Planarization by Vertex Splitting\u201d. Proc. ALCOM Int. Workshop on Graph Drawing, GD'93, 83\u201385."},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"P. Eades and C. F. X. Mendon\u00c7a (1996). \u201cVertex Splitting and Tension-Free Layout\u201d. Proc. GD'95, Lecture Notes in Computer Science\n1027, 202\u2013211.","DOI":"10.1007\/BFb0021804"},{"key":"13_CR7","first-page":"757","volume":"17","author":"R. B. Eggleton","year":"1970","unstructured":"R. B. Eggleton and R. P. Guy (1970). \u201cThe crossing number of the n-cube\u201d, AMS Notices\n17, 757.","journal-title":"AMS Notices"},{"key":"13_CR8","unstructured":"L. Faria (1994). \u201cBounds for the crossing number of the n-cube\u201d, Master thesis, Universidade Federal do Rio de Janeiro (In Portuguese)."},{"key":"13_CR9","unstructured":"L. Faria and C. M. H. Figueiredo (1997). \u201cOn the Eggleton and Guy conjectured upper bound for the crossing number of the n-cube\u201d, submitted to Math. Slovaca."},{"key":"13_CR10","volume-title":"Technical Report ES-443\/97","author":"L. Faria","year":"1997","unstructured":"L. Faria, C. M. H. Figueiredo and C. F. X. Mendon\u00c7a (1997). \u201cSplitting number is NP-Complete\u201d, Technical Report ES-443\/97, COPPE\/UFRJ, Brazil."},{"key":"13_CR11","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"M. R. Garey","year":"1983","unstructured":"M. R. Garey and D. S. Johnson (1983). \u201cCrossing number is NP-complete\u201d, SIAM J. Algebraic and Discrete Methods\n4, 312\u2013316.","journal-title":"SIAM J. Algebraic and Discrete Methods"},{"key":"13_CR12","first-page":"58","volume":"6","author":"F. Harary","year":"1973","unstructured":"F. Harary, P. C. Kainen and A. J. Schwenk (1973). \u201cToroidal graphs with arbitrarily high crossing number\u201d, Nanta Math.\n6, 58\u201367.","journal-title":"Nanta Math."},{"key":"13_CR13","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BF02582960","volume":"1","author":"N. Hartfield","year":"1985","unstructured":"N. Hartfield, B. Jackson and G. Ringel (1985). \u201cThe splitting number of the complete graph\u201d, Graphs and Combinatorics\n1, 311\u2013329.","journal-title":"Graphs and Combinatorics"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/BF01772941","volume":"42","author":"B. Jackson","year":"1984","unstructured":"B. Jackson and G. Ringel (1984). \u201cThe splitting number of complete bipartite graphs\u201d, Arch. Math.\n42, 178\u2013184.","journal-title":"Arch. Math."},{"key":"13_CR15","doi-asserted-by":"crossref","first-page":"271","DOI":"10.4064\/fm-15-1-271-283","volume":"15","author":"K. Kuratowski","year":"1930","unstructured":"K. Kuratowski (1930). \u201cSur le probl\u00e8me des courbes gauches en topologie\u201d, Fundamenta Mathematicae\n15, 271\u2013283.","journal-title":"Fundamenta Mathematicae"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"F. T. Leighton (1981). \u201cNew lower bound techniques for VLSI\u201d, Proc. 22nd Annual Symposium on Foundations of Computer Science, Long Beach CA, 1\u201312.","DOI":"10.1109\/SFCS.1981.22"},{"key":"13_CR17","unstructured":"A. Liebers (1996). \u201cMethods for Planarizing Graphs \u2014 A Survey and Annotated Bibliography\u201d, ftp:\/\/ftp.informatik.uni-konstanz.de\/pub\/preprints\/1996\/preprint-012.ps.Z."},{"key":"13_CR18","first-page":"727","volume":"24","author":"P. C. Liu","year":"1979","unstructured":"P. C. Liu and R. C. Geldmacher (1979). \u201cOn the deletion of nonplanar edges of a graph\u201d, Congressus Numerantium\n24, 727\u2013738.","journal-title":"Congressus Numerantium"},{"key":"13_CR19","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1002\/jgt.3190150109","volume":"15","author":"T. Madej","year":"1991","unstructured":"T. Madej (1991). \u201cBounds for the crossing number of the n-cube\u201d, Journal of Graph Theory\n15, 81\u201397.","journal-title":"Journal of Graph Theory"},{"key":"13_CR20","volume-title":"Ph.D. thesis","author":"C. F. X. Mendon\u00c7a","year":"1994","unstructured":"C. F. X. Mendon\u00c7a (1994). \u201cA Layout System for Information System Diagrams\u201d, Ph.D. thesis, University of Queensland, Australia."},{"key":"13_CR21","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/0095-8956(78)90014-X","volume":"24","author":"R. D. Ringeisen","year":"1978","unstructured":"R. D. Ringeisen and L. W. Beineke (1978). \u201cThe crossing number of C\n3\u00d7C\nn\u201d, Journal of Combinatorial Theory Ser. B\n24, 134\u2013136.","journal-title":"Journal of Combinatorial Theory Ser. B"},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BF01989746","volume":"33","author":"O. S\u00fdkora","year":"1993","unstructured":"O. S\u00fdkora and I. Vrto (1993). \u201cOn the crossing number of hypercubes and cube connected cycles\u201d, BIT\n33, 232\u2013237.","journal-title":"BIT"}],"container-title":["Lecture Notes in Computer Science","LATIN'98: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054317","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,10]],"date-time":"2019-02-10T23:00:08Z","timestamp":1549839608000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0054317"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540642756","9783540697152"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/bfb0054317","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}