乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T13:37:50Z","timestamp":1648906670156},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2017,10,30]],"date-time":"2017-10-30T00:00:00Z","timestamp":1509321600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,10,30]],"date-time":"2017-10-30T00:00:00Z","timestamp":1509321600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1252833, DMS-1359173"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s00373-017-1859-3","type":"journal-article","created":{"date-parts":[[2017,10,30]],"date-time":"2017-10-30T19:46:38Z","timestamp":1509392798000},"page":"1621-1634","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Large Induced Acyclic and Outerplanar Subgraphs of 2-Outerplanar Graph"],"prefix":"10.1007","volume":"33","author":[{"given":"Glencora","family":"Borradaile","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-8223-9944","authenticated-orcid":false,"given":"Hung","family":"Le","sequence":"additional","affiliation":[]},{"given":"Melissa","family":"Sherman-Bennett","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,30]]},"reference":[{"issue":"19\u201320","key":"1859_CR1","doi-asserted-by":"publisher","first-page":"2438","DOI":"10.1016\/j.disc.2006.10.017","volume":"307","author":"Y Aifeng","year":"2007","unstructured":"Aifeng, Y., Jinjiang, Y.: On the vertex arboricity of planar graphs of diameter two. Discret. Math. 307(19\u201320), 2438\u20132447 (2007)","journal-title":"Discret. Math."},{"key":"1859_CR2","unstructured":"Albertson, M.O., Berman, D.M.: A conjecture on planar graphs. In: Bondy, J.A., Murty, U.S.R. (eds.) Graph Theory and Related Topics, p. 357. Academic Press (1979)"},{"issue":"1","key":"1859_CR3","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1002\/jgt.21884","volume":"82","author":"P Angelini","year":"2016","unstructured":"Angelini, P., Evans, W., Frati, F., Gudmundsson, J.: SEFE with no mapping via large induced outerplane graphs in plane graphs. J. Graph Theory 82(1), 45\u201364 (2016)","journal-title":"J. Graph Theory"},{"issue":"1","key":"1859_CR4","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"BS Baker","year":"1994","unstructured":"Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM (JACM) 41(1), 153\u2013180 (1994)","journal-title":"J. ACM (JACM)"},{"key":"1859_CR5","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"GD Battista","year":"1998","unstructured":"Battista, G.D., Eades, P., Tollis, I.G., Tamassia, R.: Graph Drawing: Algorithms for the Visualization of Graphs, 1st edn. Prentice Hall, Englewood Cliffs (1998)","edition":"1"},{"issue":"3","key":"1859_CR6","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0012-365X(79)90077-3","volume":"25","author":"OV Borodin","year":"1979","unstructured":"Borodin, O.V.: On acyclic colorings of planar graphs. Discret. Math. 25(3), 211\u2013236 (1979)","journal-title":"Discret. Math."},{"key":"1859_CR7","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1112\/jlms\/s1-44.1.612","volume":"44","author":"G Chartrand","year":"1969","unstructured":"Chartrand, G., Kronk, H.V.: The point-arboricity of planar graphs. J. Lond. Math. Soc. 44, 612\u2013616 (1969)","journal-title":"J. Lond. Math. Soc."},{"key":"1859_CR8","unstructured":"Demaine, E.D., Hajiaghayi, M., Mohar, B.: Approximation algorithms via contraction decomposition. In: Proc. of 18th SODA, pp. 278\u2013287 (2007)"},{"key":"1859_CR9","volume-title":"Graph Theory, Graduate Texts in Mathematics","author":"R Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory, Graduate Texts in Mathematics, vol. 173, 3rd edn. Springer, Heidelberg (2005)","edition":"3"},{"key":"1859_CR10","unstructured":"Dross, F., Montassier, M., Pinlou, A.: Large induced forests in planar graphs with girth 4 or 5. \n arXiv:1409.1348\n \n (2014) (preprint)"},{"issue":"3","key":"1859_CR11","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s004530010020","volume":"27","author":"D Eppstein","year":"2000","unstructured":"Eppstein, D.: Diameter and treewidth in minor-closed graph families. Algorithmica 27(3), 275\u2013291 (2000)","journal-title":"Algorithmica"},{"issue":"3","key":"1859_CR12","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/0196-6774(84)90019-1","volume":"5","author":"JR Gilbert","year":"1984","unstructured":"Gilbert, J.R., Hutchinson, J.P., Tarjan, R.E.: A separator theorem for graphs of bounded genus. J. Algorithm 5(3), 391\u2013407 (1984)","journal-title":"J. Algorithm"},{"issue":"2","key":"1859_CR13","doi-asserted-by":"publisher","first-page":"165","DOI":"10.2307\/2323956","volume":"98","author":"P Gritzmann","year":"1991","unstructured":"Gritzmann, P., Mohar, B., Pach, J., Pollack, R.: Embedding a planar triangulation with vertices at specified points. Am. Math. Mon. 98(2), 165\u2013166 (1991)","journal-title":"Am. Math. Mon."},{"key":"1859_CR14","first-page":"27","volume":"25","author":"K Hosono","year":"1990","unstructured":"Hosono, K.: Induced forests in trees and outerplanar graphs. Proc. Fac. Sci. Tokai Univ. 25, 27\u201329 (1990)","journal-title":"Proc. Fac. Sci. Tokai Univ."},{"key":"1859_CR15","doi-asserted-by":"crossref","unstructured":"Kawarabayashi, K., Reed, B.: A separator theorem in minor-closed classes. In: In Proc. of 51st FOCS, pp. 153\u2013162 (2010)","DOI":"10.1109\/FOCS.2010.22"},{"key":"1859_CR16","unstructured":"Le, H.: A better bound on the largest induced forests in triangle-free planar graphs (2016) (Preprint)"},{"issue":"2","key":"1859_CR17","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R Lipton","year":"1979","unstructured":"Lipton, R., Tarjan, R.: A separator theorem for planar graphs. SIAM J. Appl. Math. 36(2), 177\u2013189 (1979)","journal-title":"SIAM J. Appl. Math."},{"issue":"3","key":"1859_CR18","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1137\/0209046","volume":"9","author":"RJ Lipton","year":"1980","unstructured":"Lipton, R.J., Tarjan, R.E.: Applications of a planar separator theorem. SIAM J. Comput. 9(3), 615\u2013627 (1980)","journal-title":"SIAM J. Comput."},{"key":"1859_CR19","doi-asserted-by":"publisher","first-page":"1064","DOI":"10.1016\/j.ejc.2007.11.022","volume":"29","author":"A Raspaud","year":"2008","unstructured":"Raspaud, A., Wang, W.: On the vertex-arboricity of planar graphs. Eur. J. Comb. 29, 1064\u20131075 (2008)","journal-title":"Eur. J. Comb."},{"key":"1859_CR20","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s00373-006-0642-7","volume":"22","author":"MR Salavatipour","year":"2006","unstructured":"Salavatipour, M.R.: Large induced forests in triangle-free planar graphs. Graphs Comb. 22, 113\u2013126 (2006)","journal-title":"Graphs Comb."},{"key":"1859_CR21","doi-asserted-by":"crossref","unstructured":"Shi, L., Xu, H.: Large induced forests in graphs. J. Graph Theory 85(4), 759\u2013779 (2017)","DOI":"10.1002\/jgt.22104"},{"key":"1859_CR22","unstructured":"Wang, Y., Xie, Q., Yu, X.: Induced forests in bipartite planar graphs (2016) (Preprint)"},{"issue":"2","key":"1859_CR23","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1090\/S0002-9947-1932-1501641-2","volume":"34","author":"H Whitney","year":"1932","unstructured":"Whitney, H.: Non-separable and planar graphs. Trans. Am. Math. Soc. 34(2), 339\u2013362 (1932)","journal-title":"Trans. Am. Math. Soc."},{"issue":"1","key":"1859_CR24","doi-asserted-by":"publisher","first-page":"73","DOI":"10.4064\/fm-21-1-73-84","volume":"21","author":"H Whitney","year":"1933","unstructured":"Whitney, H.: Planar graphs. Fundam. Math. 21(1), 73\u201384 (1933)","journal-title":"Fundam. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-017-1859-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1859-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1859-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,14]],"date-time":"2020-05-14T08:54:33Z","timestamp":1589446473000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-017-1859-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,30]]},"references-count":24,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["1859"],"URL":"https:\/\/doi.org\/10.1007\/s00373-017-1859-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,30]]},"assertion":[{"value":"6 February 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 September 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 October 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}