{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:51:03Z","timestamp":1725540663897},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642359255"},{"type":"electronic","value":"9783642359262"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35926-2_11","type":"book-chapter","created":{"date-parts":[[2012,12,21]],"date-time":"2012-12-21T04:32:11Z","timestamp":1356064331000},"page":"86-99","source":"Crossref","is-referenced-by-count":0,"title":["Acyclic Coloring with Few Division Vertices"],"prefix":"10.1007","author":[{"given":"Debajyoti","family":"Mondal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rahnuma Islam","family":"Nishat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Md. Saidur","family":"Rahman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sue","family":"Whitesides","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1\u20132","key":"11_CR1","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02759792","volume":"28","author":"M.O. Albertson","year":"1977","unstructured":"Albertson, M.O., Berman, D.M.: Every planar graph has an acyclic 7-coloring. Israel Journal of Mathematics\u00a028(1\u20132), 169\u2013174 (1977)","journal-title":"Israel Journal of Mathematics"},{"issue":"3","key":"11_CR2","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1002\/rsa.3240020303","volume":"2","author":"N. Alon","year":"1991","unstructured":"Alon, N., McDiarmid, C., Reed, B.A.: Acyclic coloring of graphs. Random Struct. Algorithms\u00a02(3), 277\u2013288 (1991)","journal-title":"Random Struct. Algorithms"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-642-11440-3_11","volume-title":"WALCOM: Algorithms and Computation","author":"P. Angelini","year":"2010","unstructured":"Angelini, P., Frati, F.: Acyclically 3-Colorable Planar Graphs. In: Rahman, M. S., Fujita, S. (eds.) WALCOM 2010. LNCS, vol.\u00a05942, pp. 113\u2013124. Springer, Heidelberg (2010)"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Di Battista, G., Frati, F., Pach, J.: On the queue number of planar graphs. In: 51th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2010), pp. 365\u2013374 (2010)","DOI":"10.1109\/FOCS.2010.42"},{"issue":"2","key":"11_CR5","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1002\/jgt.20549","volume":"68","author":"O.V. Borodin","year":"2011","unstructured":"Borodin, O.V., Ivanova, A.O.: Acyclic 5-choosability of planar graphs without adjacent short cycles. Journal of Graph Theory\u00a068(2), 169\u2013176 (2011)","journal-title":"Journal of Graph Theory"},{"issue":"10\u201311","key":"11_CR6","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1016\/j.disc.2006.03.017","volume":"306","author":"O.V. Borodin","year":"2006","unstructured":"Borodin, O.V.: On acyclic colorings of planar graphs. Discrete Mathematics\u00a0306(10\u201311), 953\u2013972 (2006)","journal-title":"Discrete Mathematics"},{"key":"11_CR7","first-page":"21","volume":"93","author":"M.I. Burnstein","year":"1979","unstructured":"Burnstein, M.I.: Every 4-valent graph has an acyclic 5-coloring. Soobsc Akad. Nauk Grucin\u00a093, 21\u201324 (1979)","journal-title":"Soobsc Akad. Nauk Grucin"},{"issue":"3","key":"11_CR8","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0012-365X(80)90236-8","volume":"30","author":"D.P. Dailey","year":"1980","unstructured":"Dailey, D.P.: Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete. Discrete Mathematics\u00a030(3), 289 (1980)","journal-title":"Discrete Mathematics"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Dujmovi\u0107, V., Wood, D.R.: Three-dimensional grid drawings with sub-quadratic volume. In: Pach, J. (ed.) Towards a Theory of Geometric Graphs. Contemporary Mathematics. American Mathematical Society (2004)","DOI":"10.1090\/conm\/342\/06130"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1137\/S0097539702416141","volume":"34","author":"V. Dujmovi\u0107","year":"2005","unstructured":"Dujmovi\u0107, V., Morin, P., Wood, D.R.: Layout of graphs with bounded tree-width. SIAM Journal of Computing\u00a034, 553\u2013579 (2005)","journal-title":"SIAM Journal of Computing"},{"issue":"3","key":"11_CR11","doi-asserted-by":"publisher","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.: Minimum feedback vertex set and acyclic coloring. Inf. Process. Lett.\u00a084(3), 131\u2013139 (2002)","journal-title":"Inf. Process. Lett."},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1287\/ijoc.1080.0286","volume":"21","author":"A.H. Gebremedhin","year":"2009","unstructured":"Gebremedhin, A.H., Tarafdar, A., Pothen, A., Walther, A.: Efficient computation of sparse hessians using coloring and automatic differentiation. INFORMS Journal on Computing\u00a021, 209\u2013223 (2009)","journal-title":"INFORMS Journal on Computing"},{"issue":"4","key":"11_CR13","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/BF02764716","volume":"14","author":"B. Gr\u00fcnbaum","year":"1973","unstructured":"Gr\u00fcnbaum, B.: Acyclic colorings of planar graphs. Israel Journal of Mathematics\u00a014(4), 390\u2013408 (1973)","journal-title":"Israel Journal of Mathematics"},{"issue":"15","key":"11_CR14","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1016\/j.ipl.2011.05.005","volume":"111","author":"H. Hocquard","year":"2011","unstructured":"Hocquard, H.: Graphs with maximum degree 6 are acyclically 11-colorable. Inf. Process. Lett.\u00a0111(15), 748\u2013753 (2011)","journal-title":"Inf. Process. Lett."},{"key":"11_CR15","first-page":"40","volume":"28","author":"A.V. Kostochka","year":"1976","unstructured":"Kostochka, A.V.: Acyclic 6-coloring of planar graphs. Diskretn. Anal.\u00a028, 40\u201356 (1976)","journal-title":"Diskretn. Anal."},{"issue":"1","key":"11_CR16","doi-asserted-by":"crossref","first-page":"153","DOI":"10.26493\/1855-3974.198.541","volume":"4","author":"A.V. Kostochka","year":"2011","unstructured":"Kostochka, A.V., Stocker, C.: Graphs with maximum degree 5 are acyclically 7-colorable. Ars Mathematica Contemporanea\u00a04(1), 153\u2013164 (2011)","journal-title":"Ars Mathematica Contemporanea"},{"issue":"1","key":"11_CR17","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1215\/S0012-7094-74-04119-2","volume":"41","author":"J. Mitchem","year":"1974","unstructured":"Mitchem, J.: Every planar graph has an acyclic 8-coloring. Duke Mathematical Journal\u00a041(1), 177\u2013181 (1974)","journal-title":"Duke Mathematical Journal"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-642-25011-8_20","volume-title":"Combinatorial Algorithms","author":"D. Mondal","year":"2011","unstructured":"Mondal, D., Nishat, R.I., Whitesides, S., Rahman, M. S.: Acyclic Colorings of Graph Subdivisions. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2011. LNCS, vol.\u00a07056, pp. 247\u2013260. Springer, Heidelberg (2011)"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Mondal, D., Nishat, R.I., Whitesides, S., Rahman, M.S.: Acyclic colorings of graph subdivisions revisited. Journal of Discrete Algorithms (to appear, 2012)","DOI":"10.1016\/j.jda.2012.06.001"},{"key":"11_CR20","unstructured":"Nishat, R.I.: Acyclic 3-colorings and 4-colorings of planar graph subdivisions, http:\/\/www.iwoca.org\/main_iwocaproblems.php (accessed July 2012)"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Nishizeki, T., Rahman, M.S.: Planar Graph Drawing. World Scientific (2004)","DOI":"10.1142\/5648"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Ochem, P.: Negative results on acyclic improper colorings. In: European Conference on Combinatorics (EuroComb 2005), pp. 357\u2013362 (2005)","DOI":"10.46298\/dmtcs.3441"},{"issue":"4","key":"11_CR23","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"},{"issue":"1","key":"11_CR24","first-page":"37","volume":"7","author":"D.R. Wood","year":"2005","unstructured":"Wood, D.R.: Acyclic, star and oriented colourings of graph subdivisions. Discrete Mathematics & Theoretical Computer Science\u00a07(1), 37\u201350 (2005)","journal-title":"Discrete Mathematics & Theoretical Computer Science"},{"issue":"2","key":"11_CR25","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s00454-004-1154-y","volume":"33","author":"H. Zhang","year":"2005","unstructured":"Zhang, H., He, X.: Canonical ordering trees and their applications in graph drawing. Discrete & Computational Geometry\u00a033(2), 321\u2013344 (2005)","journal-title":"Discrete & Computational Geometry"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35926-2_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,4]],"date-time":"2022-02-04T05:31:56Z","timestamp":1643952716000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35926-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642359255","9783642359262"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35926-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}