{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T13:10:09Z","timestamp":1753881009655,"version":"3.41.2"},"reference-count":15,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071265"],"award-info":[{"award-number":["12071265"]}],"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"}]},{"DOI":"10.13039\/501100013254","name":"National College Students Innovation and Entrepreneurship Training Program","doi-asserted-by":"publisher","award":["201910445053"],"award-info":[{"award-number":["201910445053"]}],"id":[{"id":"10.13039\/501100013254","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2022,4]]},"abstract":"<jats:p> Let [Formula: see text] be a plane graph with a set of faces [Formula: see text] and [Formula: see text] be a (not necessarily proper) vertex [Formula: see text]-coloring. [Formula: see text] is called polychromatic if all [Formula: see text] colors appear on the vertices of its boundary for each face (also the outer-face) [Formula: see text]. The polychromatic number of [Formula: see text] is the largest number of colors [Formula: see text] such that [Formula: see text] admits a polychromatic [Formula: see text]-coloring. In the paper, we consider a class of plane graphs [Formula: see text] with minimum face size [Formula: see text], in each of which every pair of faces have at most [Formula: see text] common incident vertices, and show that the polychromatic number for each [Formula: see text] is at least [Formula: see text]. When [Formula: see text], the result improves a known lower bound. <\/jats:p>","DOI":"10.1142\/s1793830921501287","type":"journal-article","created":{"date-parts":[[2021,4,14]],"date-time":"2021-04-14T03:43:32Z","timestamp":1618371812000},"source":"Crossref","is-referenced-by-count":0,"title":["A note on polychromatic colorings of plane graphs"],"prefix":"10.1142","volume":"14","author":[{"given":"Xinmiao","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Mathematics and Statistics, Shandong Normal University, Jinan, P. R. China"}]},{"given":"Yirong","family":"Guo","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Shandong Normal University, Jinan, P. R. China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6323-2923","authenticated-orcid":false,"given":"Xia","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Shandong Normal University, Jinan, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2021,5,19]]},"reference":[{"key":"S1793830921501287BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-009-9171-5"},{"key":"S1793830921501287BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(03)00027-0"},{"key":"S1793830921501287BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(95)00034-8"},{"key":"S1793830921501287BIB004","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1974-13468-3"},{"key":"S1793830921501287BIB005","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0070378"},{"key":"S1793830921501287BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(94)90112-0"},{"key":"S1793830921501287BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2011.11.016"},{"key":"S1793830921501287BIB008","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20357"},{"key":"S1793830921501287BIB009","doi-asserted-by":"publisher","DOI":"10.1007\/s10114-016-5519-y"},{"key":"S1793830921501287BIB010","doi-asserted-by":"publisher","DOI":"10.37236\/1458"},{"key":"S1793830921501287BIB011","first-page":"919","volume":"48","author":"Song H.","year":"2005","journal-title":"Acta Math. Sinica"},{"key":"S1793830921501287BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.12.003"},{"key":"S1793830921501287BIB013","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-016-0108-7"},{"key":"S1793830921501287BIB014","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20499"},{"key":"S1793830921501287BIB015","doi-asserted-by":"publisher","DOI":"10.21136\/CMJ.2018.0477-16"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830921501287","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,12]],"date-time":"2022-04-12T09:43:29Z","timestamp":1649756609000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830921501287"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,19]]},"references-count":15,"journal-issue":{"issue":"03","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["10.1142\/S1793830921501287"],"URL":"https:\/\/doi.org\/10.1142\/s1793830921501287","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2021,5,19]]},"article-number":"2150128"}}