{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T04:54:06Z","timestamp":1754110446375,"version":"3.37.3"},"reference-count":20,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11471293"],"award-info":[{"award-number":["11471293"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11401535"],"award-info":[{"award-number":["11401535"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2018,2]]},"abstract":"<jats:p> A proper vertex coloring of [Formula: see text] is acyclic if [Formula: see text] contains no bicolored cycle. Namely, every cycle of [Formula: see text] must be colored with at least three colors. [Formula: see text] is acyclically [Formula: see text]-colorable if for a given list assignment [Formula: see text], there exists an acyclic coloring [Formula: see text] of [Formula: see text] such that [Formula: see text] for all [Formula: see text]. If [Formula: see text] is acyclically [Formula: see text]-colorable for any list assignment with [Formula: see text] for all [Formula: see text], then [Formula: see text] is acyclically [Formula: see text]-choosable. <\/jats:p><jats:p> In this paper, we prove that planar graphs without intersecting [Formula: see text]-cycles are acyclically [Formula: see text]-choosable. This provides a sufficient condition for planar graphs to be acyclically 4-choosable and also strengthens a result in [M. Montassier, A. Raspaud and W. Wang, Acyclic 4-choosability of planar graphs without cycles of specific lengths, in Topics in Discrete Mathematics, Algorithms and Combinatorics, Vol. 26 (Springer, Berlin, 2006), pp. 473\u2013491] which says that planar graphs without [Formula: see text]-, [Formula: see text]-cycles and intersecting 3-cycles are acyclically 4-choosable. <\/jats:p>","DOI":"10.1142\/s1793830918500143","type":"journal-article","created":{"date-parts":[[2017,12,18]],"date-time":"2017-12-18T01:14:54Z","timestamp":1513559694000},"page":"1850014","source":"Crossref","is-referenced-by-count":1,"title":["Acyclic 4-choosability of planar graphs without intersecting short cycles"],"prefix":"10.1142","volume":"10","author":[{"given":"Yingcai","family":"Sun","sequence":"first","affiliation":[{"name":"Department of Mathematics, Zhejiang Normal University, Jinhua 321004, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min","family":"Chen","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Zhejiang Normal University, Jinhua 321004, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dong","family":"Chen","sequence":"additional","affiliation":[{"name":"Xingzhi College, Zhejiang Normal University, Jinhua 321004, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2018,2,14]]},"reference":[{"key":"S1793830918500143BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/BF02759792"},{"key":"S1793830918500143BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(79)90077-3"},{"key":"S1793830918500143BIB003","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.10035"},{"issue":"3","key":"S1793830918500143BIB004","first-page":"522","volume":"52","author":"Borodin O. V.","year":"2011","journal-title":"Sibirsk. Mat. Zh."},{"key":"S1793830918500143BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2010.07.001"},{"key":"S1793830918500143BIB006","doi-asserted-by":"publisher","DOI":"10.1112\/S0024610799007942"},{"key":"S1793830918500143BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2010.03.036"},{"key":"S1793830918500143BIB008","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20604"},{"key":"S1793830918500143BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2012.11.006"},{"key":"S1793830918500143BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2010.10.003"},{"key":"S1793830918500143BIB011","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.11.076"},{"key":"S1793830918500143BIB012","doi-asserted-by":"publisher","DOI":"10.1007\/BF02764716"},{"key":"S1793830918500143BIB013","first-page":"40","volume":"28","author":"Kostochka A. V.","year":"1976","journal-title":"Diskret. Anal."},{"key":"S1793830918500143BIB014","doi-asserted-by":"publisher","DOI":"10.1215\/S0012-7094-74-04119-2"},{"key":"S1793830918500143BIB015","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7643-7400-6_23"},{"key":"S1793830918500143BIB016","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-33700-8_23"},{"key":"S1793830918500143BIB017","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20206"},{"key":"S1793830918500143BIB018","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20381"},{"key":"S1793830918500143BIB019","doi-asserted-by":"publisher","DOI":"10.1007\/s11425-013-4572-6"},{"key":"S1793830918500143BIB020","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2009.05.018"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830918500143","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T23:28:59Z","timestamp":1569972539000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830918500143"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2]]},"references-count":20,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2018,2,14]]},"published-print":{"date-parts":[[2018,2]]}},"alternative-id":["10.1142\/S1793830918500143"],"URL":"https:\/\/doi.org\/10.1142\/s1793830918500143","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2018,2]]}}}