{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:44Z","timestamp":1740107144071,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,5,16]],"date-time":"2018-05-16T00:00:00Z","timestamp":1526428800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100005357","name":"Agent\u00fara na Podporu V\u00fdskumu a V\u00fdvoja","doi-asserted-by":"crossref","award":["APVV-15-0116"],"award-info":[{"award-number":["APVV-15-0116"]}],"id":[{"id":"10.13039\/501100005357","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Slovak VEGA agency","award":["1\/0368\/16"],"award-info":[{"award-number":["1\/0368\/16"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s00373-018-1904-x","type":"journal-article","created":{"date-parts":[[2018,5,16]],"date-time":"2018-05-16T09:49:36Z","timestamp":1526464176000},"page":"669-676","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Facial Rainbow Edge-Coloring of Plane Graphs"],"prefix":"10.1007","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6869-2793","authenticated-orcid":false,"given":"Stanislav","family":"Jendrol\u2019","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,16]]},"reference":[{"key":"1904_CR1","first-page":"273","volume":"2009","author":"O Amini","year":"2009","unstructured":"Amini, O., Esperet, L., van den Heuvel, J.: A unified approach to distance-two colouring of planar graphs. SODA 2009, 273\u2013282 (2009)","journal-title":"SODA"},{"key":"1904_CR2","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/j.ejc.2011.09.011","volume":"33","author":"J Azarija","year":"2012","unstructured":"Azarija, J., Erman, R., Kr\u00e1l\u2019, D., Krnc, M., Stacho, L.: Cyclic colorings of plane graphs with independent faces. Eur. J. Comb. 33, 294\u2013301 (2012)","journal-title":"Eur. J. Comb."},{"key":"1904_CR3","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0012-365X(92)90647-X","volume":"100","author":"OV Borodin","year":"1992","unstructured":"Borodin, O.V.: Cyclic coloring of plane graphs. Discrete Math. 100, 281\u2013289 (1992)","journal-title":"Discrete Math."},{"key":"1904_CR4","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1016\/j.disc.2012.11.011","volume":"313","author":"OV Borodin","year":"2013","unstructured":"Borodin, O.V.: Colorings of plane graphs: a survey. Discrete Math. 313, 517\u2013539 (2013)","journal-title":"Discrete Math."},{"key":"1904_CR5","volume-title":"Chromatic graph theory, Discrete mathematics and its applications","author":"G Chartrand","year":"2009","unstructured":"Chartrand, G., Zhang, P.: Chromatic graph theory, Discrete mathematics and its applications. CRC Press, Taylor & Francis Group, Boca Raton (2009)"},{"key":"1904_CR6","doi-asserted-by":"publisher","first-page":"2691","DOI":"10.1016\/j.disc.2016.07.026","volume":"340","author":"J Czap","year":"2017","unstructured":"Czap, J., Jendrol\u2019, S.: Facially-constrained colorings of plane graphs: a survey. Discrete Math. 340, 2691\u20132703 (2017)","journal-title":"Discrete Math."},{"unstructured":"Dvo\u0159\u00e1k, Z., Hebdige, M., Hl\u00e1sek, F., Kr\u00e1l\u2019, D.: Cyclic coloring of plane graphs with maximum face size 16 and 17 (2016). \n                    arXiv:1603.06722v1\n                    \n                   [math.CO]","key":"1904_CR7"},{"key":"1904_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/jgt.20383","volume":"62","author":"H Enomoto","year":"2009","unstructured":"Enomoto, H., Hor\u0148\u00e1k, M.: A general upper bound for the cyclic chromatic number of 3-connected plane graphs. J. Graph Theory 62, 1\u201325 (2009)","journal-title":"J. Graph Theory"},{"key":"1904_CR9","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1137\/S0895480198346150","volume":"14","author":"H Enomoto","year":"2001","unstructured":"Enomoto, H., Hor\u0148\u00e1k, M., Jendrol\u2019, S.: Cyclic chromatic number of 3-connected plane graphs. SIAM J. Discrete Math. 14, 121\u2013137 (2001)","journal-title":"SIAM J. Discrete Math."},{"key":"1904_CR10","first-page":"633","volume":"10","author":"P Erd\u0151s","year":"1975","unstructured":"Erd\u0151s, P., Simonovits, M., S\u00f3s, V.T.: Anti-Ramsey theorems, Infinite and finite sets, Vol. II, edited by A. Hajnal, R. Rado, and V. T. S\u00f3s. Colloq. Math. Soc. J\u00e1nos Bolyai 10, 633\u2013643 (1975)","journal-title":"Colloq. Math. Soc. J\u00e1nos Bolyai"},{"key":"1904_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-010-0891-3","volume":"26","author":"S Fujita","year":"2010","unstructured":"Fujita, S., Magnant, C., Ozeki, K.: Rainbow generalization of Ramsey theory: a survey. Graphs Comb. 26, 1\u201330 (2010)","journal-title":"Graphs Comb."},{"key":"1904_CR12","volume-title":"Topological Graph Theory","author":"JL Gross","year":"2001","unstructured":"Gross, J.L., Tucker, T.W.: Topological Graph Theory. Dover Publications, New York (2001)"},{"key":"1904_CR13","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1137\/060664124","volume":"22","author":"F Havet","year":"2008","unstructured":"Havet, F., Sereni, J.-S., \u0160krekovski, R.: 3-facial coloring of plane graphs. SIAM J. Discrete Math. 22, 231\u2013247 (2008)","journal-title":"SIAM J. Discrete Math."},{"key":"1904_CR14","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1137\/15M1019490","volume":"30","author":"M Hebdige","year":"2016","unstructured":"Hebdige, M., Kr\u00e1l\u2019, D.: Third case of the cyclic coloring conjecture. SIAM J. Discrete Math. 30, 525\u2013548 (2016)","journal-title":"SIAM J. Discrete Math."},{"key":"1904_CR15","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1002\/(SICI)1097-0118(199903)30:3<177::AID-JGT3>3.0.CO;2-K","volume":"30","author":"M Hor\u0148\u00e1k","year":"1999","unstructured":"Hor\u0148\u00e1k, M., Jendrol\u2019, S.: On a conjecture by Plummer and Toft. J. Graph Theory 30, 177\u2013189 (1999)","journal-title":"J. Graph Theory"},{"key":"1904_CR16","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1016\/j.disc.2009.03.016","volume":"310","author":"M Hor\u0148\u00e1k","year":"2010","unstructured":"Hor\u0148\u00e1k, M., Zl\u00e1malov\u00e1, J.: Another step towards proving a conjecture by Plummer and Toft. Discrete Math. 310, 442\u2013452 (2010)","journal-title":"Discrete Math."},{"doi-asserted-by":"publisher","unstructured":"Jendrol\u2019, S., Keke\u0148\u00e1kov\u00e1, L.: Facial rainbow colorings of plane graphs. Discuss. Math. Graph Theory, \n                    https:\/\/doi.org\/10.7151\/dmgt.2047","key":"1904_CR17","DOI":"10.7151\/dmgt.2047"},{"unstructured":"Ore, O., Plummer, M.D.: Cyclic coloration of plane graphs. In: Tutte, W.T. (ed.) Recent Progress in Combinatorics (Proceedings of the Third Waterloo Conference on Combinatorics, May 1968). Academic, Cambridge (1969)","key":"1904_CR18"},{"key":"1904_CR19","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1002\/jgt.3190110407","volume":"11","author":"MD Plummer","year":"1987","unstructured":"Plummer, M.D., Toft, B.: Cyclic coloration of 3-polytopes. J. Graph Theory 11, 507\u2013515 (1987)","journal-title":"J. Graph Theory"},{"key":"1904_CR20","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1006\/jctb.2001.2046","volume":"83","author":"DP Sanders","year":"2001","unstructured":"Sanders, D.P., Zhao, Y.: A new bound on the cyclic chromatic number. J. Comb. Theory Ser. B 83, 102\u2013111 (2001)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1904_CR21","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1006\/jctb.2001.2047","volume":"83","author":"DP Sanders","year":"2001","unstructured":"Sanders, D.P., Zhao, Y.: Planar graphs of maximum degree seven are class one. J. Comb. Theory Ser. B 83, 201\u2013212 (2001)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1904_CR22","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1002\/sapm1949281148","volume":"28","author":"CE Shannon","year":"1949","unstructured":"Shannon, C.E.: A theorem on coloring the lines of a network. J. Math. Phys. 28, 148\u2013151 (1949)","journal-title":"J. Math. Phys."},{"key":"1904_CR23","first-page":"25","volume":"3","author":"VG Vizing","year":"1964","unstructured":"Vizing, V.G.: Critical graphs with given chromatic class. Metody Diskret. Analiz. 3, 25\u201330 (1964)","journal-title":"Metody Diskret. Analiz."},{"key":"1904_CR24","volume-title":"Introduction to graph theory","author":"D West","year":"2001","unstructured":"West, D.: Introduction to graph theory, 2nd edn. Prentice hall, Upper Saddle River (2001)","edition":"2"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1904-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1904-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1904-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T21:29:39Z","timestamp":1557955779000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1904-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,16]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["1904"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1904-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2018,5,16]]},"assertion":[{"value":"16 January 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 May 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 May 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}