{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T03:28:33Z","timestamp":1752982113094},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258695"},{"type":"electronic","value":"9783642258701"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25870-1_11","type":"book-chapter","created":{"date-parts":[[2011,11,30]],"date-time":"2011-11-30T08:32:45Z","timestamp":1322641965000},"page":"107-118","source":"Crossref","is-referenced-by-count":3,"title":["Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs"],"prefix":"10.1007","author":[{"given":"Christine","family":"Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"McDermid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ichiro","family":"Suzuki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1002\/rsa.3240020303","volume":"2","author":"N. Alon","year":"1990","unstructured":"Alon, N., McDiarmid, C., Reed, B.: Acyclic colourings of graphs. Random Structures and Algorithms\u00a02, 277\u2013288 (1990)","journal-title":"Random Structures and Algorithms"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/s00453-001-0093-8","volume":"32","author":"N. Alon","year":"2002","unstructured":"Alon, N., Zaks, A.: Algorithmic aspects of acyclic edge colorings. Algorithmica\u00a032, 611\u2013614 (2002)","journal-title":"Algorithmica"},{"key":"11_CR3","first-page":"21","volume":"93","author":"M.I. Burnstein","year":"1979","unstructured":"Burnstein, M.I.: Every 4-valent graph has an acyclic five coloring, Soob\u0161\u010d. Akad. Nauk Gruzin SSR\u00a093, 21\u201324 (1979) (in Russian)","journal-title":"Akad. Nauk Gruzin SSR"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1006\/jagm.1997.0920","volume":"27","author":"G. C\u01celinescu","year":"1998","unstructured":"C\u01celinescu, G., Fernandes, C.G., Finkler, U., Karloff, H.: A better approximation algorithm for finding planar subgraphs. Journal of Algorithms\u00a027, 269\u2013302 (1998)","journal-title":"Journal of Algorithms"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Chudnovsky, M., Seymour, P.: The structure of claw-free graphs. In: Proceedings of the 20th British Combinatorial Conference, Surveys in Combinatorics 2005, Durham, pp. 153\u2013171 (2005)","DOI":"10.1017\/CBO9780511734885.008"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/3-540-45848-4_6","volume-title":"Graph Drawing","author":"K. Edwards","year":"2002","unstructured":"Edwards, K., Farr, G.: An Algorithm for Finding Large Induced Planar Subgraphs. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol.\u00a02265, pp. 75\u201383. Springer, Heidelberg (2002)"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"2396","DOI":"10.1016\/j.disc.2007.05.007","volume":"308","author":"K. Edwards","year":"2008","unstructured":"Edwards, K., Farr, G.: Planarization and fragmentability of some classes of graphs. Discrete Mathematics\u00a0308, 2396\u20132406 (2008)","journal-title":"Discrete Mathematics"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/10692760_23","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"L. Faria","year":"1998","unstructured":"Faria, L., de Figueiredo, C.M.H., Mendon\u00e7a, C.F.X.: Splitting number is NP-complete. In: Hromkovi\u010d, J., S\u00fdkora, O. (eds.) WG 1998. LNCS, vol.\u00a01517, pp. 285\u2013297. Springer, Heidelberg (1998)"},{"issue":"1-3","key":"11_CR9","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0166-218X(03)00370-6","volume":"141","author":"L. Faria","year":"2004","unstructured":"Faria, L., de Figueiredo, C.M.H., de Mendon\u00e7a Neto, C.F.X.: On the complexity of the approximation of nonplanarity parameters for cubic graphs. Discrete Applied Mathematics\u00a0141(1-3), 119\u2013134 (2004)","journal-title":"Discrete Applied Mathematics"},{"issue":"13","key":"11_CR10","doi-asserted-by":"publisher","first-page":"1774","DOI":"10.1016\/j.dam.2006.03.021","volume":"154","author":"L. Faria","year":"2006","unstructured":"Faria, L., de Figueiredo, C.M.H., Gravier, S., de Mendon\u00e7a Neto, C.F.X., Stolfi, J.: On maximum planar induced subgraphs. Discrete Applied Mathematics\u00a0154(13), 1774\u20131782 (2006)","journal-title":"Discrete Applied Mathematics"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1137\/S0036144504444711","volume":"47","author":"A.H. Gebremedhin","year":"2005","unstructured":"Gebremedhin, A.H., Manne, F., Pothen, A.: What color is your Jacobian? Graph coloring for computing derivatives. SIAM Review\u00a047, 629\u2013705 (2005)","journal-title":"SIAM Review"},{"key":"11_CR12","doi-asserted-by":"crossref","first-page":"153","DOI":"10.26493\/1855-3974.198.541","volume":"4","author":"A. Kostochka","year":"2011","unstructured":"Kostochka, A., Stocker, C.: Graphs with maximum degree 5 are acyclically 7-colorable. Ars Mathematica Contemporanea\u00a04, 153\u2013164 (2011)","journal-title":"Ars Mathematica Contemporanea"},{"issue":"1","key":"11_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00032","volume":"5","author":"A. Liebers","year":"2001","unstructured":"Liebers, A.: Planarizing graphs \u2013 a survey and annotated bibliography. Journal of Graph Algorithms and Applications\u00a05(1), 1\u201374 (2001)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"11_CR14","first-page":"727","volume":"24","author":"P.C. Liu","year":"1979","unstructured":"Liu, P.C., Geldmacher, R.C.: On the deletion of nonplanar edges of a graph. Cong. Numer.\u00a024, 727\u2013738 (1979)","journal-title":"Cong. Numer."},{"issue":"4","key":"11_CR15","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.ipl.2004.08.002","volume":"92","author":"S. Skulrattanakulchai","year":"2004","unstructured":"Skulrattanakulchai, S.: Acyclic colorings of subcubic graphs. Information Processing Letters\u00a092(4), 161\u2013167 (2004)","journal-title":"Information Processing Letters"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Node and edge-deletion NP-complete problems. In: Proceedings of the 10th Annual ACM Symposium on Theory of Computing (STOC 1978), pp. 253\u2013264 (1978)","DOI":"10.1145\/800133.804355"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1137\/0210021","volume":"10","author":"M. Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Edge-deletion problems. SIAM J. Comput.\u00a010, 297\u2013309 (1981)","journal-title":"SIAM J. Comput."},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s00373-004-0551-6","volume":"20","author":"X.-D. Zhang","year":"2004","unstructured":"Zhang, X.-D., Bylka, S.: Disjoint triangles of a cubic line graph. Graphs and Combinatorics\u00a020, 275\u2013280 (2004)","journal-title":"Graphs and Combinatorics"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25870-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T21:47:48Z","timestamp":1555710468000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25870-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642258695","9783642258701"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25870-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}