{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:22:39Z","timestamp":1759638159849},"reference-count":20,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,5,1]],"date-time":"1998-05-01T00:00:00Z","timestamp":893980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5556,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1998,5]]},"DOI":"10.1016\/s0166-218x(98)00007-9","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:23:46Z","timestamp":1051741426000},"page":"121-132","source":"Crossref","is-referenced-by-count":7,"title":["Simple planar graph partition into three forests"],"prefix":"10.1016","volume":"84","author":[{"given":"Roberto","family":"Grossi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elena","family":"Lodi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(98)00007-9_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/S0166-218X(98)00007-9_BIB2","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1109\/TIT.1966.1053860","article-title":"Coding vertices of a graph","volume":"12","author":"Breuer","year":"1966","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(98)00007-9_BIB3","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/0022-247X(67)90082-0","article-title":"An unexpected result on coding vertices of a graph","volume":"20","author":"Breuer","year":"1967","journal-title":"J. Math. Anal. Appl."},{"key":"10.1016\/S0166-218X(98)00007-9_BIB4","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01202467","article-title":"A short proof of Nash-Williams' theorem for the arboricity of a graph","volume":"10","author":"Chen","year":"1994","journal-title":"Graphs Combinatorics"},{"key":"10.1016\/S0166-218X(98)00007-9_BIB5","series-title":"Rensselaer Polytechnic Inst., messages posted on Theory-Net","author":"Franklin","year":"1993"},{"key":"10.1016\/S0166-218X(98)00007-9_BIB6_1","series-title":"Proc. ACM Symp. on Theory of Comp.","first-page":"112","article-title":"A matroid approach to finding edge connectivity and packing arborescences","author":"Gabow","year":"1991"},{"key":"10.1016\/S0166-218X(98)00007-9_BIB6_2","first-page":"259","volume":"50","author":"Gabow","year":"1995"},{"key":"10.1016\/S0166-218X(98)00007-9_BIB7","series-title":"Technical Report 16\/96","article-title":"Simple planar graph partition into three forests","author":"Grossi","year":"1996"},{"key":"10.1016\/S0166-218X(98)00007-9_BIB8","series-title":"Proc. ACM Symp. on Theory of Comp.","first-page":"519","article-title":"Randomized dynamic graph algorithms with polylogarithmic time per operation","author":"Rauch","year":"1995"},{"key":"10.1016\/S0166-218X(98)00007-9_BIB9","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","article-title":"Efficient planarity testing","volume":"21","author":"Hopcroft","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/S0166-218X(98)00007-9_BIB10","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF00288971","article-title":"Representations of graphs","volume":"17","author":"Itai","year":"1982","journal-title":"Acta Inform."},{"key":"10.1016\/S0166-218X(98)00007-9_BIB11","series-title":"Proc. IEEE Symp. on Foundat. of Comp. Sci.","first-page":"549","article-title":"Space-efficient static trees and graphs","author":"Jacobson","year":"1989"},{"key":"10.1016\/S0166-218X(98)00007-9_BIB12","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1137\/0405049","article-title":"Implicit representation of graphs","volume":"5","author":"Kannan","year":"1992","journal-title":"SIAM J. Disc. Math."},{"key":"10.1016\/S0166-218X(98)00007-9_BIB13","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0166-218X(93)E0150-W","article-title":"Short encodings of planar graphs and maps","volume":"58","author":"Keeler","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(98)00007-9_BIB14","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0166-218X(90)90011-Z","article-title":"Succinct representations of general unlabeled graphs","volume":"28","author":"Naor","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(98)00007-9_BIB15","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","article-title":"Edge-disjoint spanning trees of finite graphs","volume":"36","author":"Nash-Williams","year":"1961","journal-title":"J. London Math. Soc."},{"key":"10.1016\/S0166-218X(98)00007-9_BIB16","series-title":"Planar Graphs: Theory and Algorithms","author":"Nishizeki","year":"1988"},{"key":"10.1016\/S0166-218X(98)00007-9_BIB17","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1002\/net.3230120206","article-title":"A network flow solution to some non-linear 0-1 programming problems, with applications to graph theory","volume":"12","author":"Picard","year":"1982","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(98)00007-9_BIB18","series-title":"Proc. of Foundations of Software Technology and Theoretical Computer Science, India","first-page":"37","article-title":"Efficient algorithms for vertex arboricity of planar graphs","volume":"vol. 1026","author":"Roychoudhury","year":"1995"},{"key":"10.1016\/S0166-218X(98)00007-9_BIB19","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0166-218X(84)90126-4","article-title":"Succinct representation of graphs","volume":"8","author":"Tur\u00e1n","year":"1984","journal-title":"Discrete Appl. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98000079?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98000079?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T17:23:39Z","timestamp":1555176219000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X98000079"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,5]]},"references-count":20,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,5]]}},"alternative-id":["S0166218X98000079"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(98)00007-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,5]]}}}