{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T12:41:52Z","timestamp":1774528912279,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,8,1]],"date-time":"2009-08-01T00:00:00Z","timestamp":1249084800000},"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":[[2009,8]]},"DOI":"10.1007\/s00373-009-0843-y","type":"journal-article","created":{"date-parts":[[2009,8,17]],"date-time":"2009-08-17T14:40:39Z","timestamp":1250520039000},"page":"401-407","source":"Crossref","is-referenced-by-count":17,"title":["On the 7 Total Colorability of Planar Graphs with Maximum Degree 6 and without 4-cycles"],"prefix":"10.1007","volume":"25","author":[{"given":"Lan","family":"Shen","sequence":"first","affiliation":[]},{"given":"Yingqian","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,8,18]]},"reference":[{"key":"843_CR1","unstructured":"Andersen, L.: Total coloring of simple graph. Master\u2019s thesis, University of Aalborg, 1993 (in Danish)"},{"key":"843_CR2","unstructured":"Behzad, M.: Graphs and their chromatic numbers. Ph. D. Thesis, Michigan State University, 1965"},{"key":"843_CR3","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph theory with applications. Macmillan Press LTD, 1976","DOI":"10.1007\/978-1-349-03521-2"},{"key":"843_CR4","unstructured":"Borodin, O.V.: Coupled colorings of graphs on a plane. Metody Diskret. Analiz. 45, 21\u201327 (in Russian) (1987)"},{"key":"843_CR5","unstructured":"Borodin, O.V.: On the total coloring of planar graphs. J. Reine Angew. Math. 394, 180\u2013185 (1989)"},{"key":"843_CR6","doi-asserted-by":"crossref","unstructured":"Borodin, O.V., Kostochka, A.V., Woodall, D.R.: Total coloring 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":"843_CR7","unstructured":"Borodin, O.V., Kostochka, A.V., Woodall, D.R.: List edge and list total colourings of multigraphs. J. Combin. Theory Ser. B 71, 184\u2013204 (1997)"},{"key":"843_CR8","doi-asserted-by":"crossref","unstructured":"Borodin, O.V., Kostochka, A.V., Woodall, D.R.: Total colourings of planar graphs with large girth. European J. Combin 19, 19\u201324 (1998)","DOI":"10.1006\/eujc.1997.0152"},{"key":"843_CR9","unstructured":"Chen, M., Wang, Y.Q.: A note on totally coloring of plane graphs, Journal of Zhejiang Normal University (Natural Sciences), 30, 421\u2013423 (in Chinese) (2007)"},{"key":"843_CR10","doi-asserted-by":"crossref","unstructured":"Hou, J.F., Liu, G.Z., Cai, J.S.: 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":"843_CR11","doi-asserted-by":"crossref","unstructured":"Hou, J.F., Zhu, Y., Liu, G.Z., Wu, J.L., Lan, M.: Total coloring of planar graphs without small cycles. Graphs and Combinatorics 24, 91\u2013100 (2008)","DOI":"10.1007\/s00373-008-0778-8"},{"key":"843_CR12","unstructured":"Kowalik, L., Sereni, J.S., \u0160krekovski, R.: Total colouring of plane graphs with maximum degree nine. SIAM J. Discr. Math. 4, 1462\u20131479 (2008)"},{"key":"843_CR13","unstructured":"Liu, B., Hou, J.F., Liu, G.Z.: List edge and list total colorings of planar graphs without short cycles. Inform. Process. Lett. 108, 347\u2013351 (2008)"},{"key":"843_CR14","doi-asserted-by":"crossref","unstructured":"Sanders, D.P., Zhao, Y.: On total 9-coloring of 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":"843_CR15","doi-asserted-by":"crossref","unstructured":"Vizing, V.G.: Some unsolved problems in graph theory. Uspekhi Mat. Nauk 23, 117\u2013134 (in Russian) (1968)","DOI":"10.1070\/RM1968v023n06ABEH001252"},{"key":"843_CR16","unstructured":"Shen, L., Wang, Y.Q.: Total colorings of planar graphs with maximum degree at least 8. Science in China 38, 1356\u20131364 (in Chinese) (2008)"},{"key":"843_CR17","doi-asserted-by":"crossref","unstructured":"Wang, Y.Q., Shangguan, M.L., Li, Q.: On total chromatic number of planar graphs without 4-cycles. Science in China 50, 81\u201386 (2007)","DOI":"10.1007\/s11434-007-2031-x"},{"key":"843_CR18","doi-asserted-by":"crossref","unstructured":"Wang, W.F.: Total chromatic number of planar graphs with maximum degree ten. J. Graph Theory, 54, 91\u2013102 (2007)","DOI":"10.1002\/jgt.20195"},{"key":"843_CR19","doi-asserted-by":"crossref","unstructured":"Yap, H.P.: Total-coloring of graphs. Lecture Notes in Mathematics 1623. Springer, Berlin (1996)","DOI":"10.1007\/BFb0092895"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-009-0843-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-009-0843-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-009-0843-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:29Z","timestamp":1559055509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-009-0843-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["843"],"URL":"https:\/\/doi.org\/10.1007\/s00373-009-0843-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,8]]}}}