{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T04:03:22Z","timestamp":1747800202321,"version":"3.41.0"},"reference-count":9,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100017623","name":"Zhejiang Provincial Outstanding Youth Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100017623","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004731","name":"Zhejiang Province Natural Science Foundation","doi-asserted-by":"publisher","award":["LZ23A010004"],"award-info":[{"award-number":["LZ23A010004"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12371360"],"award-info":[{"award-number":["12371360"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Mathematics and Computation"],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1016\/j.amc.2025.129493","type":"journal-article","created":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T13:17:50Z","timestamp":1745932670000},"page":"129493","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Choosability with union separation of planar graphs without intersecting triangles"],"prefix":"10.1016","volume":"502","author":[{"given":"Xinhong","family":"Pang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.amc.2025.129493_br0020","series-title":"Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing","article-title":"Choosability in graphs","author":"Erd\u0151s","year":"1979"},{"key":"10.1016\/j.amc.2025.129493_br0030","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2020.112137","article-title":"Choosability with union separation of triangle-free planar graphs","volume":"343","author":"Hou","year":"2020","journal-title":"Discrete Math."},{"key":"10.1016\/j.amc.2025.129493_br0040","article-title":"Choosability with union separation of planar graphs without cycles of length 4","volume":"386","author":"Hou","year":"2020","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.amc.2025.129493_br0050","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1016\/j.disc.2017.10.022","article-title":"Choosability with union separation","volume":"341","author":"Kumbhat","year":"2018","journal-title":"Discrete Math."},{"key":"10.1016\/j.amc.2025.129493_br0060","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1007\/s40840-021-01218-4","article-title":"On (3, r)-choosability of some planar graphs","volume":"45","author":"Li","year":"2022","journal-title":"Bull. Malays. Math. Sci. Soc."},{"key":"10.1016\/j.amc.2025.129493_br0070","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1006\/jctb.1994.1062","article-title":"Every planar graph is 5-choosable","volume":"62","author":"Thomassen","year":"1994","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.amc.2025.129493_br0090","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0012-365X(93)90579-I","article-title":"List colourings of planar graphs","volume":"120","author":"Voigt","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/j.amc.2025.129493_br0100","first-page":"3","article-title":"Coloring the vertices of a graph in prescribed colors","volume":"101","author":"Vizing","year":"1976","journal-title":"Metody Diskret. Anal. Teorii Kodov Shem"},{"key":"10.1016\/j.amc.2025.129493_br0110","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1137\/S0895480100376253","article-title":"Choosability and edge choosability of planar graphs without intersecting triangles","volume":"15","author":"Wang","year":"2002","journal-title":"SIAM J. Discrete Math."}],"container-title":["Applied Mathematics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S009630032500219X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S009630032500219X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,5,20]],"date-time":"2025-05-20T09:08:36Z","timestamp":1747732116000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S009630032500219X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10]]},"references-count":9,"alternative-id":["S009630032500219X"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.amc.2025.129493","relation":{},"ISSN":["0096-3003"],"issn-type":[{"type":"print","value":"0096-3003"}],"subject":[],"published":{"date-parts":[[2025,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Choosability with union separation of planar graphs without intersecting triangles","name":"articletitle","label":"Article Title"},{"value":"Applied Mathematics and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.amc.2025.129493","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"129493"}}