{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T19:05:36Z","timestamp":1649185536164},"reference-count":10,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2014,6]]},"abstract":"<jats:p> A plane graph G is entirely k-choosable if, for every list L of colors satisfying L(x) = k for x \u2208 V(G) \u222a E(G) \u222a F(G), there exists a coloring which assigns to each vertex, each edge and each face a color from its list so that any adjacent or incident elements receive different colors. In this paper, we show that every plane graph G with maximum degree \u0394 \u2264 5 is entirely (\u0394 + 5)-choosable. <\/jats:p>","DOI":"10.1142\/s1793830914500232","type":"journal-article","created":{"date-parts":[[2014,1,23]],"date-time":"2014-01-23T09:54:02Z","timestamp":1390470842000},"page":"1450023","source":"Crossref","is-referenced-by-count":2,"title":["PLANE GRAPHS ARE ENTIRELY (\u0394 + 5)-CHOOSABLE"],"prefix":"10.1142","volume":"06","author":[{"given":"XIAOXUE","family":"HU","sequence":"first","affiliation":[{"name":"Department of Mathematics, Zhejiang Normal University, Jinhua 321004, P. R. China"}]},{"given":"YIQIAO","family":"WANG","sequence":"additional","affiliation":[{"name":"School of Management, Beijing University of Chinese Medicine, Beijing 100029, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2014,3,19]]},"reference":[{"key":"rf1","first-page":"21","volume":"45","author":"Borodin O. V.","journal-title":"Metody Diskret. Analiz"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0118(199611)23:3<233::AID-JGT3>3.0.CO;2-T"},{"key":"rf3","first-page":"35","volume":"53","author":"Borodin O. V.","journal-title":"Mat. Zametki"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.12.014"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0118(199911)32:3<250::AID-JGT5>3.0.CO;2-R"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1972-13041-6"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(73)90142-8"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.4153\/CMB-2000-017-7"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20292"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2011.02.006"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830914500232","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T15:44:27Z","timestamp":1565192667000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830914500232"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,19]]},"references-count":10,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2014,3,19]]},"published-print":{"date-parts":[[2014,6]]}},"alternative-id":["10.1142\/S1793830914500232"],"URL":"https:\/\/doi.org\/10.1142\/s1793830914500232","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,19]]}}}