{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T04:26:41Z","timestamp":1778732801012,"version":"3.51.4"},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,2,1]],"date-time":"2018-02-01T00:00:00Z","timestamp":1517443200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T00:00:00Z","timestamp":1645488000000},"content-version":"vor","delay-in-days":1482,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100000038","name":"NSERC","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Dipartimento di Ingegneria dell'Universit\u00e0 degli Studi di Perugia"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1016\/j.tcs.2017.12.024","type":"journal-article","created":{"date-parts":[[2017,12,21]],"date-time":"2017-12-21T18:21:17Z","timestamp":1513880477000},"page":"78-84","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["New results on edge partitions of 1-plane graphs"],"prefix":"10.1016","volume":"713","author":[{"given":"Emilio","family":"Di Giacomo","sequence":"first","affiliation":[]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[]},{"given":"William S.","family":"Evans","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2886-9694","authenticated-orcid":false,"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Henk","family":"Meijer","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0543-8912","authenticated-orcid":false,"given":"Fabrizio","family":"Montecchiani","sequence":"additional","affiliation":[]},{"given":"Stephen K.","family":"Wismath","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2017.12.024_br0010","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/j.dam.2014.05.025","article-title":"A note on 1-planar graphs","volume":"175","author":"Ackerman","year":"2014","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"10.1016\/j.tcs.2017.12.024_br0020","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","article-title":"A linear-time algorithm for testing the truth of certain quantified boolean formulas","volume":"8","author":"Aspvall","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.tcs.2017.12.024_br0030","series-title":"SoCG 2016","first-page":"19:1","article-title":"On visibility representations of non-planar graphs","volume":"vol. 51","author":"Biedl","year":"2016"},{"key":"10.1016\/j.tcs.2017.12.024_br0040","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2016.04.026","article-title":"Recognizing and drawing IC-planar graphs","volume":"636","author":"Brandenburg","year":"2016","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/j.tcs.2017.12.024_br0050","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0095-8956(71)90065-7","article-title":"Graphs with forbidden subgraphs","volume":"10","author":"Chartrand","year":"1971","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"10.1016\/j.tcs.2017.12.024_br0060","doi-asserted-by":"crossref","first-page":"P54","DOI":"10.37236\/2392","article-title":"On drawings and decompositions of 1-planar graphs","volume":"20","author":"Czap","year":"2013","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.tcs.2017.12.024_br0070","author":"Czap"},{"key":"10.1016\/j.tcs.2017.12.024_br0080","article-title":"Ortho-polygon visibility representations of embedded graphs","author":"Di Giacomo","year":"2017","journal-title":"Algorithmica"},{"issue":"2","key":"10.1016\/j.tcs.2017.12.024_br0090","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1006\/jctb.2000.1962","article-title":"Surfaces, tree-width, clique-minors, and partitions","volume":"79","author":"Ding","year":"2000","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.tcs.2017.12.024_br0100","series-title":"Congr. Num.","first-page":"69","article-title":"Partitioning the edges of a planar graph into two partial k-trees","author":"Elmallah","year":"1988"},{"key":"10.1016\/j.tcs.2017.12.024_br0110","series-title":"STOC 2005","first-page":"504","article-title":"Edge partition of planar graphs into two outerplanar graphs","author":"Gon\u00e7alves","year":"2005"},{"issue":"2","key":"10.1016\/j.tcs.2017.12.024_br0120","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1006\/jctb.1996.0043","article-title":"Outerplanar partitions of planar graphs","volume":"67","author":"Kedlaya","year":"1996","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.tcs.2017.12.024_br0130","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.cosrev.2017.06.002","article-title":"An annotated bibliography on 1-planarity","volume":"25","author":"Kobourov","year":"2017","journal-title":"Comput. Sci. Rev."},{"issue":"3","key":"10.1016\/j.tcs.2017.12.024_br0140","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1002\/jgt.20448","article-title":"Coloring plane graphs with independent crossings","volume":"64","author":"Kr\u00e1l","year":"2010","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.tcs.2017.12.024_br0150","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.tcs.2016.12.004","article-title":"On partitioning the edges of 1-plane graphs","volume":"662","author":"Lenhart","year":"2017","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/j.tcs.2017.12.024_br0160","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/j.ipl.2015.11.011","article-title":"L-visibility drawings of IC-planar graphs","volume":"116","author":"Liotta","year":"2016","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.tcs.2017.12.024_br0170","series-title":"SODA 1990","first-page":"138","article-title":"Embedding planar graphs on the grid","author":"Schnyder","year":"1990"},{"issue":"4","key":"10.1016\/j.tcs.2017.12.024_br0180","doi-asserted-by":"crossref","first-page":"1527","DOI":"10.1137\/090746835","article-title":"Re-embeddings of maximum 1-planar graphs","volume":"24","author":"Suzuki","year":"2010","journal-title":"SIAM J. Discrete Math."},{"issue":"12","key":"10.1016\/j.tcs.2017.12.024_br0190","doi-asserted-by":"crossref","first-page":"2045","DOI":"10.1007\/s10114-014-3763-6","article-title":"Drawing complete multipartite graphs on the plane with restrictions on crossings","volume":"30","author":"Zhang","year":"2014","journal-title":"Acta Math. Sinica"},{"issue":"2","key":"10.1016\/j.tcs.2017.12.024_br0200","first-page":"308","article-title":"The structure of plane graphs with independent crossings and its applications to coloring problems","volume":"11","author":"Zhang","year":"2013","journal-title":"Cent. Eur. J. Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397517309192?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397517309192?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T03:02:49Z","timestamp":1645498969000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397517309192"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2]]},"references-count":20,"alternative-id":["S0304397517309192"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2017.12.024","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2018,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"New results on edge partitions of 1-plane graphs","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2017.12.024","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}