{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:28:49Z","timestamp":1753885729493,"version":"3.41.2"},"reference-count":13,"publisher":"World Scientific Pub Co Pte Ltd","issue":"05","funder":[{"name":"National Research Foundation of Korea(NRF) grant funded by the Korea governmen","award":["NRF-2018R1A2B6003412"],"award-info":[{"award-number":["NRF-2018R1A2B6003412"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11901252","11871311","12031018"],"award-info":[{"award-number":["11901252","11871311","12031018"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Scientific Research Foundation of Jiangsu Province","award":["19KJB110010"],"award-info":[{"award-number":["19KJB110010"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2022,7]]},"abstract":"<jats:p> A signed graph is a pair [Formula: see text], where [Formula: see text] is a graph and [Formula: see text] is a signature of [Formula: see text]. A set [Formula: see text] of integers is symmetric if [Formula: see text] implies that [Formula: see text]. Given a list assignment [Formula: see text] of [Formula: see text], an [Formula: see text]-coloring of a signed graph [Formula: see text] is a coloring [Formula: see text] of [Formula: see text] such that [Formula: see text] for each [Formula: see text] and [Formula: see text] for every edge [Formula: see text]. The signed choice number [Formula: see text] of a graph [Formula: see text] is defined to be the minimum integer [Formula: see text] such that for any [Formula: see text]-list assignment [Formula: see text] of [Formula: see text] and for any signature [Formula: see text] on [Formula: see text], there is a proper [Formula: see text]-coloring of [Formula: see text]. <\/jats:p><jats:p> List signed coloring is a generalization of list coloring. However, the difference between signed choice number and choice number can be arbitrarily large. Hu and Wu [Planar graphs without intersecting [Formula: see text]-cycles are [Formula: see text]-choosable, Discrete Math.\u00a0340 (2017) 1788\u20131792] showed that every planar graph without intersecting 5-cycles is 4-choosable. In this paper, we prove that [Formula: see text] if [Formula: see text] is a planar graph without intersecting 5-cycles, which extends the main result of [D. Hu and J. Wu, Planar graphs without intersecting [Formula: see text]-cycles are [Formula: see text]-choosable, Discrete Math.\u00a0340 (2017) 1788\u20131792]. <\/jats:p>","DOI":"10.1142\/s1793830921501512","type":"journal-article","created":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T07:02:22Z","timestamp":1625641342000},"source":"Crossref","is-referenced-by-count":0,"title":["Planar graphs without intersecting 5-cycles are signed-4-choosable"],"prefix":"10.1142","volume":"14","author":[{"given":"Seog-Jin","family":"Kim","sequence":"first","affiliation":[{"name":"Department of Mathematics Education, Konkuk University, Korea"}]},{"given":"Xiaowei","family":"Yu","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Jiangsu Normal University, Xuzhou, Jiangsu 221116, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2021,7,6]]},"reference":[{"key":"S1793830921501512BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/BF01204715"},{"key":"S1793830921501512BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2020.06.009"},{"key":"S1793830921501512BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2017.09.001"},{"key":"S1793830921501512BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2017.09.019"},{"key":"S1793830921501512BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2017.03.012"},{"key":"S1793830921501512BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2015.10.001"},{"key":"S1793830921501512BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2016.05.013"},{"key":"S1793830921501512BIB008","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.22147"},{"key":"S1793830921501512BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2018.03.027"},{"key":"S1793830921501512BIB011","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.22425"},{"key":"S1793830921501512BIB012","doi-asserted-by":"publisher","DOI":"10.37236\/4938"},{"key":"S1793830921501512BIB013","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(82)90144-3"},{"key":"S1793830921501512BIB014","first-page":"501","volume-title":"Algorithmic Aspects in Information and Management","author":"Zhu H.","year":"2020"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830921501512","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T04:51:09Z","timestamp":1659415869000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830921501512"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,6]]},"references-count":13,"journal-issue":{"issue":"05","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["10.1142\/S1793830921501512"],"URL":"https:\/\/doi.org\/10.1142\/s1793830921501512","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2021,7,6]]},"article-number":"2150151"}}