{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,12]],"date-time":"2024-07-12T00:09:06Z","timestamp":1720742946655},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,10,27]],"date-time":"2018-10-27T00:00:00Z","timestamp":1540598400000},"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":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s00373-018-1971-z","type":"journal-article","created":{"date-parts":[[2018,10,27]],"date-time":"2018-10-27T05:09:48Z","timestamp":1540616988000},"page":"1489-1506","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Entire Coloring of Graphs Embedded in a Surface of Nonnegative Characteristic"],"prefix":"10.1007","volume":"34","author":[{"given":"Xiaoxue","family":"Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weifan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiqiao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ping","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,27]]},"reference":[{"key":"1971_CR1","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s00373-006-0653-4","volume":"22","author":"MO Albertson","year":"2006","unstructured":"Albertson, M.O., Mohar, B.: Coloring vertices and faces of locally planar graphs. Graphs Comb. 22, 289\u2013295 (2006)","journal-title":"Graphs Comb."},{"key":"1971_CR2","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1090\/S0002-9904-1976-14122-5","volume":"82","author":"K Appel","year":"1976","unstructured":"Appel, K., Haken, W.: Every planar graph map is four colourable. Bull. Am. Math. Soc. 82, 711\u2013712 (1976)","journal-title":"Bull. Am. Math. Soc."},{"key":"1971_CR3","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1002\/(SICI)1097-0118(199912)32:4<327::AID-JGT2>3.0.CO;2-B","volume":"32","author":"T B\u00f6hme","year":"1999","unstructured":"B\u00f6hme, T., Mohar, B., Stiebitz, M.: Dirac\u2019s map-color theorem for choosability. J. Graph Theory 32, 327\u2013339 (1999)","journal-title":"J. Graph Theory"},{"key":"1971_CR4","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1002\/jgt.3190190406","volume":"19","author":"OV Borodin","year":"1995","unstructured":"Borodin, O.V.: A new proof of the 6 colour theorem. J. Graph Theory 19, 507\u2013521 (1995)","journal-title":"J. Graph Theory"},{"key":"1971_CR5","doi-asserted-by":"publisher","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, O.V.: Structural theorem on plane graphs with application to the entire coloring number. J. Graph Theory 23, 233\u2013239 (1996)","journal-title":"J. Graph Theory"},{"key":"1971_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jgt.20460","volume":"65","author":"L Cai","year":"2010","unstructured":"Cai, L., Wang, W., Zhu, X.: Choosability of toroidal graphs without short cycles. J. Graph Theory 65, 1\u201315 (2010)","journal-title":"J. Graph Theory"},{"key":"1971_CR7","first-page":"189","volume":"2","author":"AJ Harris","year":"1985","unstructured":"Harris, A.J.: Problems and conjectures in extremal graph theory. Graphs Comb. 2, 189\u2013190 (1985)","journal-title":"Graphs Comb."},{"key":"1971_CR8","first-page":"332","volume":"24","author":"PJ Heawood","year":"1890","unstructured":"Heawood, P.J.: Map-color theorems. Q. J. Math. 24, 332\u2013338 (1890)","journal-title":"Q. J. Math."},{"key":"1971_CR9","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.tcs.2017.05.018","volume":"689","author":"X Hu","year":"2017","unstructured":"Hu, X., Wang, P., Wang, Y., Wang, W.: The entire chromatic number of graphs embedded on the torus with large maximum degree. Theor. Comput. Sci. 689, 108\u2013116 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"1971_CR10","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1002\/(SICI)1097-0118(199911)32:3<250::AID-JGT5>3.0.CO;2-R","volume":"32","author":"M Juvan","year":"1999","unstructured":"Juvan, M., Mohar, B., \u0160krekovski, R.: Graphs of degree 4 are 5-edge-choosable. J. Graph Theory 32, 250\u2013264 (1999)","journal-title":"J. Graph Theory"},{"key":"1971_CR11","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s00493-008-2315-z","volume":"28","author":"D Kr\u00e1l","year":"2008","unstructured":"Kr\u00e1l, D., Thomas, R.: Coloring even-faced graphs in the torus and the Klein bottle. Combinatorica 28, 325\u2013341 (2008)","journal-title":"Combinatorica"},{"key":"1971_CR12","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0012-365X(73)90142-8","volume":"5","author":"HV Kronk","year":"1973","unstructured":"Kronk, H.V., Mitchem, J.: A seven-color theorem on the sphere. Discret. Math. 5, 253\u2013260 (1973)","journal-title":"Discret. Math."},{"key":"1971_CR13","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.ipl.2006.11.005","volume":"102","author":"X Luo","year":"2007","unstructured":"Luo, X.: The 4-choosability of toroidal graphs without intersecting triangles. Inf. Process. Lett. 102, 85\u201391 (2007)","journal-title":"Inf. Process. Lett."},{"key":"1971_CR14","unstructured":"Mel\u2019nikov, L.S.: Problem 9. In: Recent Advances in Graph Theory, Proceedings of the International Symposium, Prague, 1974, p. 543. Academia Praha, Prague (1975)"},{"key":"1971_CR15","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1073\/pnas.60.2.438","volume":"60","author":"G Ringel","year":"1968","unstructured":"Ringel, G., Youngs, J.W.T.: Solution of the Heawood map-coloring problem. Proc. Natl. Acad. Sci. USA 60, 438\u2013445 (1968)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"1971_CR16","unstructured":"Ringel, G.: A nine color theorem for the torus and the Klein bottle. In: The Theory and Applications of Graphs (Kalamazoo, Michigan, 1980), pp. 507\u2013515. Wiley, New York (1981)"},{"key":"1971_CR17","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/S0167-5060(08)70477-1","volume-title":"Graph Theory in Memory of G.A. Dirac","author":"H. Schumacher","year":"1988","unstructured":"Schumacher, H.: About the chromatic number of 1-embeddable graphs. In: Graph Theory in Memory of G.A. Dirac (Sandbjerg, 1985). Annals of Discrete Mathematics, vol. 41, pp. 397\u2013400. North Holland, Amsterdam (1989)"},{"key":"1971_CR18","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0012-365X(00)00064-9","volume":"224","author":"DP Sanders","year":"2000","unstructured":"Sanders, D.P., Maharry, J.: On simultaneous colorings of embedded graphs. Discret. Math. 224, 207\u2013214 (2000)","journal-title":"Discret. Math."},{"key":"1971_CR19","first-page":"441","volume":"17","author":"DP Sanders","year":"1997","unstructured":"Sanders, D.P., Zhao, Y.: On simultaneous edge-face colourings of plane graphs. Combinatorica 17, 441\u2013445 (1997)","journal-title":"Combinatorica"},{"key":"1971_CR20","doi-asserted-by":"publisher","first-page":"108","DOI":"10.4153\/CMB-2000-017-7","volume":"43","author":"DP Sanders","year":"2000","unstructured":"Sanders, D.P., Zhao, Y.: On the entire coloring conjecture. Can. Math. Bull. 43, 108\u2013114 (2000)","journal-title":"Can. Math. Bull."},{"key":"1971_CR21","doi-asserted-by":"publisher","first-page":"3523","DOI":"10.1016\/j.disc.2007.12.055","volume":"309","author":"W Wang","year":"2009","unstructured":"Wang, W.: The edge-face coloring of graphs embedded in a surface of characteristic zero. Discret. Math. 309, 3523\u20133533 (2009)","journal-title":"Discret. Math."},{"key":"1971_CR22","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0012-365X(01)00451-4","volume":"253","author":"W Wang","year":"2002","unstructured":"Wang, W., Lih, K.-W.: A new proof of Mel\u2019nikov\u2019s conjecture on the edge-face colouring of plane graphs. Discret. Math. 253, 87\u201395 (2002)","journal-title":"Discret. Math."},{"key":"1971_CR23","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1016\/j.ejc.2003.12.007","volume":"25","author":"W Wang","year":"2004","unstructured":"Wang, W., Lih, K.-W.: The edge-face choosability of plane graphs. Eur. J. Comb. 25, 935\u2013948 (2004)","journal-title":"Eur. J. Comb."},{"key":"1971_CR24","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1002\/jgt.20292","volume":"58","author":"W Wang","year":"2008","unstructured":"Wang, W., Lih, K.-W.: Coupled choosability of plane graphs. J. Graph Theory 58, 27\u201344 (2008)","journal-title":"J. Graph Theory"},{"key":"1971_CR25","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1016\/j.jctb.2011.02.006","volume":"101","author":"W Wang","year":"2011","unstructured":"Wang, W., Zhu, X.: Entire colouring of plane graphs. J. Comb. Theory Ser. B 101, 490\u2013501 (2011)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1971_CR26","doi-asserted-by":"publisher","first-page":"1892","DOI":"10.1137\/130938992","volume":"28","author":"Y Wang","year":"2014","unstructured":"Wang, Y., Hu, X., Wang, W.: Plane graphs with $$\\varDelta \\ge 9$$ \u0394 \u2265 9 are entirely $$(\\varDelta +2)$$ ( \u0394 + 2 ) -colorable. SIAM J. Discret. Math. 28, 1892\u20131905 (2014)","journal-title":"SIAM J. Discret. Math."},{"key":"1971_CR27","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1006\/jctb.1997.1725","volume":"69","author":"AO Waller","year":"1997","unstructured":"Waller, A.O.: Simultaneously colouring the edges and faces of plane graphs. J. Comb. Theory Ser. B 69, 219\u2013221 (1997)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1971_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0092895","volume-title":"Total Colourings of Graphs. Lecture Notes in Mathematics","author":"HP Yap","year":"1996","unstructured":"Yap, H.P.: Total Colourings of Graphs. Lecture Notes in Mathematics, vol. 16. Springer, Berlin (1996)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1971-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1971-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1971-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T20:41:37Z","timestamp":1720730497000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1971-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,27]]},"references-count":28,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["1971"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1971-z","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10,27]]},"assertion":[{"value":"3 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 September 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 October 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}