{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T12:00:44Z","timestamp":1649160044030},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,12,5]],"date-time":"2014-12-05T00:00:00Z","timestamp":1417737600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s10878-014-9819-9","type":"journal-article","created":{"date-parts":[[2014,12,4]],"date-time":"2014-12-04T04:56:52Z","timestamp":1417669012000},"page":"1221-1240","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The entire choosability of plane graphs"],"prefix":"10.1007","volume":"31","author":[{"given":"Weifan","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tingting","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoxue","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiqiao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,12,5]]},"reference":[{"key":"9819_CR1","first-page":"21","volume":"45","author":"OV Borodin","year":"1987","unstructured":"Borodin OV (1987) Coupled colorings of graphs on a plane. Metod Diskret Anal 45:21\u201327 (in Russian)","journal-title":"Metod Diskret Anal"},{"key":"9819_CR2","first-page":"35","volume":"53","author":"OV Borodin","year":"1993","unstructured":"Borodin OV (1993) Simultaneous coloring of edge neighborhoods in planar graphs and the simultaneous coloring of vertices, edges and faces. Mat Zamet 53:35\u201347 (in Russian)","journal-title":"Mat Zamet"},{"key":"9819_CR3","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0012-365X(94)90101-5","volume":"128","author":"OV Borodin","year":"1994","unstructured":"Borodin OV (1994) Simultaneous coloring of edges and faces of plane graphs. Discret Math 128:21\u201333","journal-title":"Discret Math"},{"key":"9819_CR4","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1002\/jgt.3190190406","volume":"19","author":"OV Borodin","year":"1995","unstructured":"Borodin OV (1995) A new proof of the 6 colour theorem. J Graph Theory 19:507\u2013521","journal-title":"J Graph Theory"},{"key":"9819_CR5","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1002\/(SICI)1097-0118(199611)23:3<233::AID-JGT3>3.0.CO;2-T","volume":"23","author":"OV Borodin","year":"1996","unstructured":"Borodin OV (1996) Structural theorm on plane graphs with application to the entire coloring number. J Graph Theory 23:233\u2013239","journal-title":"J Graph Theory"},{"key":"9819_CR6","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1016\/j.disc.2012.11.011","volume":"313","author":"OV Borodin","year":"2013","unstructured":"Borodin OV (2013) Colorings of plane graphs: a survey. Discret Math 313:517\u2013539","journal-title":"Discret Math"},{"key":"9819_CR7","doi-asserted-by":"crossref","first-page":"1257","DOI":"10.1016\/j.dam.2011.12.014","volume":"160","author":"W Dong","year":"2012","unstructured":"Dong W (2012) A note on entire choosability of plane graphs. Discret Appl Math 160:1257\u20131261","journal-title":"Discret Appl Math"},{"key":"9819_CR8","doi-asserted-by":"crossref","first-page":"2153","DOI":"10.1016\/j.disc.2008.04.043","volume":"309","author":"TJ Hetherington","year":"2009","unstructured":"Hetherington TJ (2009) Entire choosablity of near-outerplane graphs. Discret Math 309:2153\u20132165","journal-title":"Discret Math"},{"key":"9819_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.disc.2014.03.008","volume":"327","author":"X Hu","year":"2014","unstructured":"Hu X, Wang W, Wang Y (2014) The edge-face choosability of plane graphs with maximum degree at least 9. Discret Math 327:1\u20138","journal-title":"Discret Math"},{"issue":"2","key":"9819_CR10","doi-asserted-by":"crossref","first-page":"1450023","DOI":"10.1142\/S1793830914500232","volume":"6","author":"X Hu","year":"2014","unstructured":"Hu X, Wang Y (2014) Plane graphs are entirely $$(\\Delta +5)$$ ( \u0394 + 5 ) -choosable. Discret Math Algorithms Appl 6(2):1450023 9 pp.","journal-title":"Discret Math Algorithms Appl"},{"key":"9819_CR11","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1090\/S0002-9904-1972-13041-6","volume":"78","author":"HV Kronk","year":"1972","unstructured":"Kronk HV, Mitchem J (1972) The entire chromatic number of a normal graph is at most seven. Bull Am Math Soc 78:799\u2013800","journal-title":"Bull Am Math Soc"},{"key":"9819_CR12","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(73)90142-8","volume":"5","author":"HV Kronk","year":"1973","unstructured":"Kronk HV, Mitchem J (1973) A seven color theorem on the sphere. Discret Math 5:253\u2013260","journal-title":"Discret Math"},{"key":"9819_CR13","doi-asserted-by":"crossref","first-page":"108","DOI":"10.4153\/CMB-2000-017-7","volume":"43","author":"DP Sanders","year":"2000","unstructured":"Sanders DP, Zhao Y (2000) On the entire coloring conjecture. Can Math Bull 43:108\u2013114","journal-title":"Can Math Bull"},{"key":"9819_CR14","first-page":"25","volume":"3","author":"VG Vizing","year":"1964","unstructured":"Vizing VG (1964) On an estimate of the chromatic index of a p-graph. Diskret Anal 3:25\u201330","journal-title":"Diskret Anal"},{"key":"9819_CR15","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0012-365X(94)00242-B","volume":"147","author":"W Wang","year":"1995","unstructured":"Wang W (1995) On the colorings of outerplanar graphs. Discret Math 147:257\u2013269","journal-title":"Discret Math"},{"key":"9819_CR16","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1006\/eujc.1998.0258","volume":"20","author":"W Wang","year":"1999","unstructured":"Wang W (1999) Upper bounds of entire chromatic number of plane graphs. Eur J Comb 20:313\u2013315","journal-title":"Eur J Comb"},{"key":"9819_CR17","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1016\/j.jctb.2011.02.006","volume":"101","author":"W Wang","year":"2011","unstructured":"Wang W, Zhu X (2011) Entire coloring of plane graphs. J Comb Theory Ser B 101:490\u2013501","journal-title":"J Comb Theory Ser B"},{"key":"9819_CR18","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1002\/jgt.21676","volume":"73","author":"Y Wang","year":"2013","unstructured":"Wang Y, Mao X, Miao Z (2013) Plane graphs with maximum degree $$\\Delta \\ge 8$$ \u0394 \u2265 8 are entirely $$(\\Delta +3)$$ ( \u0394 + 3 ) -colorable. J Graph Theory 73:305\u2013317","journal-title":"J Graph Theory"},{"key":"9819_CR19","doi-asserted-by":"crossref","first-page":"1892","DOI":"10.1137\/130938992","volume":"28","author":"Y Wang","year":"2014","unstructured":"Wang Y, Hu X, Wang W (2014) Plane graphs with $$\\Delta \\ge 9$$ \u0394 \u2265 9 are entirely $$(\\Delta +2)$$ ( \u0394 + 2 ) -colorable. SIAM J Discret Math 28:1892\u20131905","journal-title":"SIAM J Discret Math"},{"key":"9819_CR20","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s10255-005-0215-1","volume":"21","author":"J Wu","year":"2005","unstructured":"Wu J, Wu Y (2005) The entire coloring of series-parallel graphs. Acta Math Appl Sin Engl Ser 21:61\u201366","journal-title":"Acta Math Appl Sin Engl Ser"},{"key":"9819_CR21","first-page":"1169","volume":"36","author":"Z Zhang","year":"1993","unstructured":"Zhang Z, Wang J, Wang W, Wang L (1993) The complete chromatic number of some planar graphs. Sci China Ser A 36:1169\u20131177","journal-title":"Sci China Ser A"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9819-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9819-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9819-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:25Z","timestamp":1559276605000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9819-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,5]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["9819"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9819-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,5]]}}}