{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T12:20:33Z","timestamp":1763641233486},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T00:00:00Z","timestamp":1207008000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2008,4]]},"DOI":"10.1007\/s00373-008-0778-8","type":"journal-article","created":{"date-parts":[[2008,5,14]],"date-time":"2008-05-14T17:59:19Z","timestamp":1210787959000},"page":"91-100","source":"Crossref","is-referenced-by-count":28,"title":["Total Colorings of Planar Graphs without Small Cycles"],"prefix":"10.1007","volume":"24","author":[{"given":"Jianfeng","family":"Hou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guizhen","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianliang","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mei","family":"Lan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,5,15]]},"reference":[{"key":"778_CR1","unstructured":"Behzad, M.: Graphs and their chromatic number, Doctoral Thesis, Michigan State University (1965)"},{"key":"778_CR2","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Macmillan Press, London (1976)","DOI":"10.1007\/978-1-349-03521-2"},{"key":"778_CR3","unstructured":"Borodin, O.V.: On the total coloring of planar graphs. J. Reine Angew. Math. 394, 180\u2013185 (1989)"},{"key":"778_CR4","doi-asserted-by":"crossref","unstructured":"Borodin, O.V., Kostochka, A.V., Woodall, D.R.: Total colourings of planar graphs with large maximum degree. J. Graph Theory 26, 53\u201359 (1997)","DOI":"10.1002\/(SICI)1097-0118(199709)26:1<53::AID-JGT6>3.0.CO;2-G"},{"key":"778_CR5","doi-asserted-by":"crossref","unstructured":"Borodin, O.V., Kostochka, A.V., Woodall, D.R.: Total colourings of planar graphs with large girth. Europ. J. Combinatorics 19, 19\u201324 (1998)","DOI":"10.1006\/eujc.1997.0152"},{"key":"778_CR6","doi-asserted-by":"crossref","unstructured":"Hou, J., Liu, G., Cai, J.: List edge and list total colorings of planar graphs without 4-cycles. Theoretical Computer Science 369, 250\u2013255 (2006)","DOI":"10.1016\/j.tcs.2006.08.043"},{"key":"778_CR7","doi-asserted-by":"crossref","unstructured":"Kostochka, A.V.: The total coloring of a multigraph with maximum degree 4. Discrete Math. 17, 161\u2013163 (1977)","DOI":"10.1016\/0012-365X(77)90146-7"},{"key":"778_CR8","unstructured":"Kostochka, A.V.: Upper bounds of chromatic functions on graphs (in Russian), Doctoral Thesis, Novosibirsk 1978"},{"key":"778_CR9","unstructured":"Kostochka, A.V.: The total chromatic number of any multigraph with maximum degree five is at most seven, Discrete Math. 162, 199\u2013214 (1996)"},{"key":"778_CR10","unstructured":"Rosenfeld, M.: On the total coloring of certain graphs. Israel J. Math. 9, 396\u2013402 (1971)"},{"key":"778_CR11","doi-asserted-by":"crossref","unstructured":"Sanchez-Arroyo, A.: Determining the total coloring number is NP-hard. Discrete Math. 78, 315\u2013319 (1989)","DOI":"10.1016\/0012-365X(89)90187-8"},{"key":"778_CR12","doi-asserted-by":"crossref","unstructured":"Sanders, D.P., Zhao, Y.: On total 9-coloring planar graphs of maximum degree seven. J. Graph Theory 31, 67\u201373 (1999)","DOI":"10.1002\/(SICI)1097-0118(199905)31:1<67::AID-JGT6>3.0.CO;2-C"},{"key":"778_CR13","unstructured":"Vijayaditya, N.: On total chromatic number of a graph. J. London Math. Soc. 3(2), 405\u2013408 (1971)"},{"key":"778_CR14","unstructured":"Vizing, V.G.: Some unsolved problems in graph theory (in Russian), Uspekhi Mat. Nauk 23, 117\u2013134 (1968) English translation in Russian Math. Surveys 23, 125\u2013141"},{"key":"778_CR15","doi-asserted-by":"crossref","unstructured":"Wang, P., Wu, J.L.: A note on total colorings of planar graphs without 4-cycles. Discussiones Mathematicae Graph Theory 24, 125\u2013135 (2004)","DOI":"10.7151\/dmgt.1219"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0778-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-008-0778-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0778-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:28Z","timestamp":1559055508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-008-0778-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,4]]}},"alternative-id":["778"],"URL":"https:\/\/doi.org\/10.1007\/s00373-008-0778-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,4]]}}}