{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T16:39:16Z","timestamp":1740155956293,"version":"3.37.3"},"reference-count":8,"publisher":"World Scientific Pub Co Pte Ltd","issue":"05","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Fund of China","doi-asserted-by":"crossref","award":["11771403"],"award-info":[{"award-number":["11771403"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2018,10]]},"abstract":"<jats:p>This paper proves that if [Formula: see text] is a planar graph without cycles of length [Formula: see text] to [Formula: see text], with triangles having distance at least two and contains no special configurations, then [Formula: see text] is [Formula: see text]-paintable (and hence is [Formula: see text]-choosable).<\/jats:p>","DOI":"10.1142\/s1793830918500672","type":"journal-article","created":{"date-parts":[[2018,8,21]],"date-time":"2018-08-21T01:10:02Z","timestamp":1534813802000},"page":"1850067","source":"Crossref","is-referenced-by-count":0,"title":["3-Paintability of planar graphs"],"prefix":"10.1142","volume":"10","author":[{"given":"Huihui","family":"Yan","sequence":"first","affiliation":[{"name":"Department of Mathematics, Zhejiang Normal University, Jinhua, Zhejiang, P. R. China"}]},{"given":"Hao","family":"Qi","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Zhejiang Normal University, Jinhua, Zhejiang, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2018,10,11]]},"reference":[{"key":"S1793830918500672BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/BF01204715"},{"key":"S1793830918500672BIB002","doi-asserted-by":"publisher","DOI":"10.1134\/S1990478910020031"},{"key":"S1793830918500672BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2004.11.001"},{"key":"S1793830918500672BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2016.07.006"},{"key":"S1793830918500672BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2017.09.001"},{"key":"S1793830918500672BIB006","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830917500112"},{"key":"S1793830918500672BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2005.10.014"},{"issue":"1","key":"S1793830918500672BIB008","doi-asserted-by":"crossref","first-page":"18","DOI":"10.37236\/166","volume":"16","author":"Schauz U.","year":"2009","journal-title":"Electron. J. Combin."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830918500672","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,8]],"date-time":"2020-11-08T01:43:47Z","timestamp":1604799827000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830918500672"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":8,"journal-issue":{"issue":"05","published-online":{"date-parts":[[2018,10,11]]},"published-print":{"date-parts":[[2018,10]]}},"alternative-id":["10.1142\/S1793830918500672"],"URL":"https:\/\/doi.org\/10.1142\/s1793830918500672","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2018,10]]}}}