{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,2]],"date-time":"2023-11-02T11:41:23Z","timestamp":1698925283194},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3705,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[2003,7]]},"DOI":"10.1016\/s0095-8956(03)00037-6","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T23:27:29Z","timestamp":1051745249000},"page":"347-367","source":"Crossref","is-referenced-by-count":18,"title":["Crossing-number critical graphs have bounded path-width"],"prefix":"10.1016","volume":"88","author":[{"given":"Petr","family":"Hlin\u011bny","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0095-8956(03)00037-6_BIB1","doi-asserted-by":"crossref","unstructured":"M. Ajtai, V. Chv\u00e1tal, M.M. Newborn, E. Szemer\u00e9di, Crossing-free subgraphs, Theory and Practice of Combinatorics, North-Holland Mathematics Studies, Vol. 60, North-Holland, Amsterdam, New York, 1982, pp. 9\u201312.","DOI":"10.1016\/S0304-0208(08)73484-4"},{"key":"10.1016\/S0095-8956(03)00037-6_BIB2","first-page":"97","article-title":"The crossing number of C6\u00d7C6","volume":"118","author":"Anderson","year":"1996","journal-title":"Congr. Numer"},{"key":"10.1016\/S0095-8956(03)00037-6_BIB3","first-page":"97","article-title":"The crossing number of C7\u00d7C7","volume":"125","author":"Anderson","year":"1997","journal-title":"Congr. Numer"},{"key":"10.1016\/S0095-8956(03)00037-6_BIB4","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/0095-8956(91)90068-U","article-title":"Quickly excluding a forest","volume":"52","author":"Bienstock","year":"1991","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0095-8956(03)00037-6_BIB5","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/0022-0000(84)90071-0","article-title":"A frame for solving VLSI graph layout problems","volume":"28","author":"Bhatt","year":"1984","journal-title":"J. Comput. Systems Sci"},{"key":"10.1016\/S0095-8956(03)00037-6_BIB6","series-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"Di Battista","year":"1999"},{"key":"10.1016\/S0095-8956(03)00037-6_BIB7","unstructured":"G. Ding, B. Oporowski, R. Thomas, D. Vertigan, Large four-connected nonplanar graphs, unpublished."},{"key":"10.1016\/S0095-8956(03)00037-6_BIB8","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1137\/0604033","article-title":"Crossing number is NP-complete","volume":"4","author":"Garey","year":"1983","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/S0095-8956(03)00037-6_BIB9","unstructured":"J. Geelen, B. Richter, G. Salazar, Embedding grids on surfaces, manuscript, 2000."},{"key":"10.1016\/S0095-8956(03)00037-6_BIB10","doi-asserted-by":"crossref","unstructured":"P. Hlin\u011bn\u00fd, Crossing-Critical Graphs and Path-width, in: Graph Drawing, 9th Symposium GD 2001, Vienna, Austria, September 2001; Lecture Notes in Computer Science, Vol. 2265, Springer, Berlin, 2002, pp. 102\u2013114.","DOI":"10.1007\/3-540-45848-4_9"},{"key":"10.1016\/S0095-8956(03)00037-6_BIB11","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0012-365X(87)90108-7","article-title":"Construction of crossing-critical graphs","volume":"66","author":"Kochol","year":"1987","journal-title":"Discrete Math"},{"key":"10.1016\/S0095-8956(03)00037-6_BIB12","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/BF01215922","article-title":"Graphs drawn with few crossings per edge","volume":"17","author":"Pach","year":"1997","journal-title":"Combinatorica"},{"key":"10.1016\/S0095-8956(03)00037-6_BIB13","unstructured":"J. Pach, G. T\u00f3th, Which crossing number is it, anyway?, Proceedings of the 39th Foundations of Computer Science (1998), IEEE Press, New York, 1999, pp. 617\u2013626."},{"key":"10.1016\/S0095-8956(03)00037-6_BIB14","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/BF02574034","article-title":"Intersections of curve systems and the crossing number of C5\u00d7C5","volume":"13","author":"Richter","year":"1995","journal-title":"Discrete Comput. Geom"},{"key":"10.1016\/S0095-8956(03)00037-6_BIB15","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":"Richter","year":"1993","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0095-8956(03)00037-6_BIB16","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","article-title":"Graph minors I. Excluding a forest","volume":"35","author":"Robertson","year":"1983","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0095-8956(03)00037-6_BIB17","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0021-9800(70)80007-2","article-title":"Toward a theory of crossing numbers","volume":"8","author":"Tutte","year":"1970","journal-title":"J. Combin. Theory"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895603000376?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895603000376?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T17:11:28Z","timestamp":1584637888000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0095895603000376"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0095895603000376"],"URL":"https:\/\/doi.org\/10.1016\/s0095-8956(03)00037-6","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}