{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:43:37Z","timestamp":1759063417890},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,10,5]],"date-time":"2014-10-05T00:00:00Z","timestamp":1412467200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1007\/s10878-014-9799-9","type":"journal-article","created":{"date-parts":[[2014,10,4]],"date-time":"2014-10-04T05:17:03Z","timestamp":1412399823000},"page":"902-911","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Acyclic 3-coloring of generalized Petersen graphs"],"prefix":"10.1007","volume":"31","author":[{"given":"Enqiang","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zepeng","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zehui","family":"Shao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chanjuan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,5]]},"reference":[{"key":"9799_CR1","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02759792","volume":"28","author":"MO Albertson","year":"1977","unstructured":"Albertson MO, Berman DM (1977) Every planar graph has an acyclic 7-coloring. Israel J Math 28:169\u2013174","journal-title":"Israel J Math"},{"key":"9799_CR2","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1007\/s10878-011-9385-3","volume":"24","author":"P Angelini","year":"2012","unstructured":"Angelini P, Frati F (2012) Acyclically 3-colorable planar graphs. J Comb Optim 24:116\u2013130","journal-title":"J Comb Optim"},{"key":"9799_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph theory","author":"JA Bondy","year":"2008","unstructured":"Bondy JA, Murty USR (2008) Graph theory. Springer, New York"},{"key":"9799_CR4","first-page":"18","volume":"231","author":"OV Borodin","year":"1976","unstructured":"Borodin OV (1976) A proof of gr\u00fcnbaum\u2019s conjecture on the acyclic 5-colorability of planar graphs. Dokl Akad Nauk SSSR 231:18\u201320","journal-title":"Dokl Akad Nauk SSSR"},{"issue":"8","key":"9799_CR5","doi-asserted-by":"crossref","first-page":"241","DOI":"10.7155\/jgaa.00091","volume":"3","author":"JM Boyer","year":"2004","unstructured":"Boyer JM, Myrvold WJ (2004) On the cutting edge: Simplified $$o(n)$$ o ( n ) planarity by edge addition. J Graph Algorithm Appl 3(8):241\u2013273","journal-title":"J Graph Algorithm Appl"},{"key":"9799_CR6","doi-asserted-by":"crossref","unstructured":"Cheng C, McDermid E, Suzuki I (2011) Planarization and acyclic colorings of subcubic claw-free graphs. Graph-theoretic concepts in computer science. In Proceedings of the 37th international workshop, WG 2011, Tepl\u00e1 Monastery, June 21\u201324","DOI":"10.1007\/978-3-642-25870-1_11"},{"key":"9799_CR7","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1137\/0607026","volume":"7","author":"TF Coleman","year":"1986","unstructured":"Coleman TF, Cai JY (1986) The cyclic coloring problem and estimation of sparse hessian matrices. SIAM J Algebraic Discret Methods 7:221\u2013235","journal-title":"SIAM J Algebraic Discret Methods"},{"key":"9799_CR8","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1137\/S0097539702416141","volume":"34","author":"V Dujmovi\u0107","year":"2005","unstructured":"Dujmovi\u0107 V, Morin P, Wood DR (2005) Layout of graphs with bounded tree-width. SIAM J Comput 34:553\u2013579","journal-title":"SIAM J Comput"},{"key":"9799_CR9","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/S0020-0190(02)00265-X","volume":"84","author":"G Fertin","year":"2002","unstructured":"Fertin G, Godard E, Raspaud A (2002) Minimum feedback vertex set and acyclic coloring. Inform Process Lett 84:131\u2013139","journal-title":"Inform Process Lett"},{"key":"9799_CR10","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1287\/ijoc.1080.0286","volume":"21","author":"AH Gebremedhin","year":"2009","unstructured":"Gebremedhin AH, Tarafdar A, Pothen A, Walther A (2009) Efficient computation of sparse hessians using coloring and automatic differentiation. Inform J Comput 21:209\u2013223","journal-title":"Inform J Comput"},{"key":"9799_CR11","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/BF02764716","volume":"14","author":"B Gr\u00fcnbaum","year":"1973","unstructured":"Gr\u00fcnbaum B (1973) Acyclic colorings of planar graphs. Israel J Math 14:390\u2013408","journal-title":"Israel J Math"},{"key":"9799_CR12","first-page":"40","volume":"28","author":"AV Kostochka","year":"1976","unstructured":"Kostochka AV (1976) Acyclic 6-coloring of planar graphs. Metody Diskret Anal 28:40\u201356","journal-title":"Metody Diskret Anal"},{"key":"9799_CR13","unstructured":"McKay BD (2013) Nauty user\u2019s guide. Computer Science Department, Australian National University, Software available from http:\/\/cs.anu.edu.au\/~bdm\/nauty . Accessed 3 July 2013"},{"key":"9799_CR14","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1215\/S0012-7094-74-04119-2","volume":"41","author":"J Mitchem","year":"1974","unstructured":"Mitchem J (1974) Every planar graph has an acyclic 8-coloring. Duke Math J 41:177\u2013181","journal-title":"Duke Math J"},{"key":"9799_CR15","doi-asserted-by":"crossref","unstructured":"Mondal D, Nishat RI, Rahman MS, Whitesides S (2013) Acyclic coloring with few division vertices. J Discret Algorithms 23:42\u201353","DOI":"10.1016\/j.jda.2013.08.002"},{"key":"9799_CR16","doi-asserted-by":"crossref","unstructured":"Mondal D, Nishat RI, Whitesides S, Rahman MS (2012) Acyclic coloring of graph subdivisions revisited. J Discret Algorithms 16:90\u2013103","DOI":"10.1016\/j.jda.2012.06.001"},{"key":"9799_CR17","doi-asserted-by":"crossref","unstructured":"Ochem P (2005) Negative results on acyclic improper colorings. In Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb\u201905), pp. 357\u2013362","DOI":"10.46298\/dmtcs.3441"},{"key":"9799_CR18","doi-asserted-by":"crossref","unstructured":"Watkins ME (1969) A theorem on tait colorings with an application to the generalized petersen graphs. J Combin Theory 6:152\u2013164","DOI":"10.1016\/S0021-9800(69)80116-X"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9799-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9799-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9799-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,18]],"date-time":"2022-04-18T23:23:33Z","timestamp":1650324213000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9799-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,5]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,2]]}},"alternative-id":["9799"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9799-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,5]]}}}