{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:48:32Z","timestamp":1759063712221},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T00:00:00Z","timestamp":1626998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T00:00:00Z","timestamp":1626998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s00373-021-02378-7","type":"journal-article","created":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T09:02:58Z","timestamp":1627030978000},"page":"2621-2636","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Acyclic Edge Coloring of Chordal Graphs with Bounded Degree"],"prefix":"10.1007","volume":"37","author":[{"given":"Yulai","family":"Ma","sequence":"first","affiliation":[]},{"given":"Yongtang","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Weifan","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,23]]},"reference":[{"key":"2378_CR1","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1016\/j.ipl.2016.07.002","volume":"116","author":"FN Abu-Khzam","year":"2016","unstructured":"Abu-Khzam, F.N., Heggernes, P.: Enumerrating minimal dominating sets in chordal graphs. Inf. Process. Lett. 116, 739\u2013743 (2016)","journal-title":"Inf. Process. Lett."},{"key":"2378_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.: Acyclic coloring of graphs. Random Struct. Algorithms 2, 277\u2013288 (1991)","journal-title":"Random Struct. Algorithms"},{"key":"2378_CR3","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1002\/jgt.1010","volume":"37","author":"N Alon","year":"2001","unstructured":"Alon, N., Sudakov, B., Zaks, A.: Acyclic edge colorings of graphs. J. Graph Theory 37, 157\u2013167 (2001)","journal-title":"J. Graph Theory"},{"key":"2378_CR4","doi-asserted-by":"publisher","first-page":"6650","DOI":"10.1016\/j.disc.2007.12.036","volume":"308","author":"M Basavaraju","year":"2008","unstructured":"Basavaraju, M., Chandran, L.S.: Acyclic edge coloring of subcubic graphs. Discrete Math. 308, 6650\u20136653 (2008)","journal-title":"Discrete Math."},{"key":"2378_CR5","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1002\/jgt.20376","volume":"61","author":"M Basavaraju","year":"2009","unstructured":"Basavaraju, M., Chandran, L.S.: Acyclic edge coloring of graphs with maximum degree $$4$$. J. Graph Theory 61, 192\u2013209 (2009)","journal-title":"J. Graph Theory"},{"key":"2378_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/jgt.20559","volume":"69","author":"M Basavaraju","year":"2012","unstructured":"Basavaraju, M., Chandran, L.S.: Acyclic edge coloring of 2-degenerate graph. J. Graph Theory 69, 1\u201327 (2012)","journal-title":"J. Graph Theory"},{"key":"2378_CR7","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1137\/090776676","volume":"25","author":"M Basavaraju","year":"2011","unstructured":"Basavaraju, M., Chandran, L.S., Cohen, N., Havet, F., M\u00fcller, T.: Acyclic edge-coloring of planar graphs. SIAM J. Discrete Math. 25, 463\u2013478 (2011)","journal-title":"SIAM J. Discrete Math."},{"key":"2378_CR8","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1016\/j.ejc.2013.02.007","volume":"34","author":"L Esperet","year":"2013","unstructured":"Esperet, L., Parreau, A.: Acyclic edge-coloring using entropy compression. Eur. J. Combin. 34, 1019\u20131027 (2013)","journal-title":"Eur. J. Combin."},{"key":"2378_CR9","first-page":"139","volume":"28","author":"J Fiam\u010dik","year":"1978","unstructured":"Fiam\u010dik, J.: The acyclic chromatic class of a graph. Math. Slov. 28, 139\u2013145 (1978). (in Russian)","journal-title":"Math. Slov."},{"key":"2378_CR10","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.tcs.2016.12.011","volume":"665","author":"L Giotis","year":"2017","unstructured":"Giotis, L., Kirousis, L., Psaromiligkos, K.I., Thilikos, D.M.: Acyclic edge colouring through the Lov$$\\acute{\\rm a}$$sz Local Lemma. Theoret. Comput. Sci. 665, 40\u201350 (2017)","journal-title":"Theoret. Comput. Sci."},{"key":"2378_CR11","doi-asserted-by":"crossref","unstructured":"Molloy, M., Reed, B.: Further algorithmic aspects of Lov\u00e1sz local lemma. In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp. 524\u2013529 (1998)","DOI":"10.1145\/276698.276866"},{"key":"2378_CR12","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1016\/j.ejc.2011.12.002","volume":"33","author":"S Ndreca","year":"2012","unstructured":"Ndreca, S., Procacci, A., Scoppola, B.: Improved bounds on coloring of graphs. Eur. J. Combin. 33, 592\u2013609 (2012)","journal-title":"Eur. J. Combin."},{"key":"2378_CR13","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s40840-017-0484-x","volume":"42","author":"Q Shu","year":"2019","unstructured":"Shu, Q., Wang, Y., Ma, Y., Wang, W.: Acyclic edge coloring of $$4$$-regular graphs without $$3$$-cycles. Bull. Malays. Math. Sci. Soc. 42, 285\u2013296 (2019)","journal-title":"Bull. Malays. Math. Sci. Soc."},{"key":"2378_CR14","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. Inf. Process. Lett. 92, 161\u2013167 (2004)","journal-title":"Inf. Process. Lett."},{"key":"2378_CR15","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.dam.2015.07.015","volume":"201","author":"T Wang","year":"2016","unstructured":"Wang, T., Zhang, Y.: Further result on acyclic chromatic index of planar graphs. Discrete Appl. Math. 201, 228\u2013247 (2016)","journal-title":"Discrete Appl. Math."},{"key":"2378_CR16","doi-asserted-by":"publisher","first-page":"2047","DOI":"10.1007\/s40840-017-0592-7","volume":"42","author":"W Wang","year":"2019","unstructured":"Wang, W., Ma, Y., Shu, Q., Wang, Y.: Acyclic edge coloring of $$4$$-regular graphs (II). Bull. Malays. Math. Sci. Soc. 42, 2047\u20132054 (2019)","journal-title":"Bull. Malays. Math. Sci. Soc."},{"key":"2378_CR17","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/j.ejc.2012.07.008","volume":"34","author":"W Wang","year":"2013","unstructured":"Wang, W., Shu, Q., Wang, Y.: A new upper bound on the acyclic chromatic indices of planar graphs. Eur. J. Combin. 34, 338\u2013354 (2013)","journal-title":"Eur. J. Combin."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02378-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-021-02378-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02378-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T21:30:16Z","timestamp":1636839016000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-021-02378-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,23]]},"references-count":17,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["2378"],"URL":"https:\/\/doi.org\/10.1007\/s00373-021-02378-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,23]]},"assertion":[{"value":"10 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 September 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 July 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 July 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}