{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T16:39:04Z","timestamp":1740155944920,"version":"3.37.3"},"reference-count":9,"publisher":"World Scientific Pub Co Pte Ltd","issue":"06","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11701342"],"award-info":[{"award-number":["11701342"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2019MA032"],"award-info":[{"award-number":["ZR2019MA032"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2020,12]]},"abstract":"<jats:p> The [Formula: see text]-total choice number of [Formula: see text], denoted by [Formula: see text], is the minimum [Formula: see text] such that [Formula: see text] is [Formula: see text]-[Formula: see text]-total choosable. It was proved in [Y. Yu, X. Zhang and G. Z. Liu, List (d,1)-total labeling of graphs embedded in surfaces, Oper. Res. Trans. 15(3) (2011) 29\u201337.] that [Formula: see text] if [Formula: see text] is a graph embedded in surface with Euler characteristic [Formula: see text] and [Formula: see text] big enough. In this paper, we prove that: (i) if [Formula: see text] is a planar graph with [Formula: see text] and [Formula: see text]-cycle is not adjacent to [Formula: see text]-cycle, [Formula: see text], then [Formula: see text]; (ii) if [Formula: see text] is a planar graph with [Formula: see text] and [Formula: see text]-cycle is not adjacent to [Formula: see text]-cycle, where [Formula: see text], then [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s1793830920500810","type":"journal-article","created":{"date-parts":[[2020,6,20]],"date-time":"2020-06-20T04:30:02Z","timestamp":1592627402000},"page":"2050081","source":"Crossref","is-referenced-by-count":0,"title":["Two results on K-(2,1)-total choosability of planar graphs"],"prefix":"10.1142","volume":"12","author":[{"given":"Yan","family":"Song","sequence":"first","affiliation":[{"name":"School of Mathematics and Statistics, Shandong Normal University, Jinan 250014, P. R. China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5050-7630","authenticated-orcid":false,"given":"Lei","family":"Sun","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Shandong Normal University, Jinan 250014, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2020,7,30]]},"reference":[{"key":"S1793830920500810BIB001","first-page":"586","volume":"5","author":"Griggs J. R.","year":"1992","journal-title":"J. Discrete Math."},{"key":"S1793830920500810BIB002","first-page":"3","volume-title":"Workshop on Graphs and Algorithms","author":"Havet F.","year":"2003"},{"key":"S1793830920500810BIB004","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.disc.2006.06.030","volume":"307","author":"Havet F.","year":"2007","journal-title":"J. Discrete Math."},{"key":"S1793830920500810BIB005","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.disc.2006.06.030","volume":"307","author":"Kcmnitz A.","year":"2007","journal-title":"J. Discrete Math."},{"key":"S1793830920500810BIB006","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/s10878-015-9958-7","volume":"33","author":"Sun L.","year":"2017","journal-title":"J. Comb. Optim."},{"key":"S1793830920500810BIB007","first-page":"499","volume":"8","author":"Whittlesey M. A.","year":"1995","journal-title":"J. Discrete Math."},{"key":"S1793830920500810BIB008","first-page":"25","volume":"1","author":"Yu Y.","year":"2012","journal-title":"D. Shandong Univ."},{"key":"S1793830920500810BIB009","first-page":"1625","volume":"20","author":"Yu Y.","year":"2017","journal-title":"J. Discrete Math."},{"key":"S1793830920500810BIB010","doi-asserted-by":"crossref","first-page":"2211","DOI":"10.1016\/j.disc.2018.04.025","volume":"341","author":"Zhu H. Y.","year":"2018","journal-title":"J. Discrete Math."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830920500810","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,29]],"date-time":"2020-11-29T05:01:46Z","timestamp":1606626106000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830920500810"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,30]]},"references-count":9,"journal-issue":{"issue":"06","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["10.1142\/S1793830920500810"],"URL":"https:\/\/doi.org\/10.1142\/s1793830920500810","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2020,7,30]]}}}