{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:13Z","timestamp":1759638853019,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,9,16]],"date-time":"2015-09-16T00:00:00Z","timestamp":1442361600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2015M570572"],"award-info":[{"award-number":["2015M570572"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shandong Provincial Natural Science Foundation of China","award":["ZR2014AQ001"],"award-info":[{"award-number":["ZR2014AQ001"]}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2015M570568"],"award-info":[{"award-number":["2015M570568"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11402075"],"award-info":[{"award-number":["11402075"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Natural Science Foundation of China","award":["71171120"],"award-info":[{"award-number":["71171120"]}]},{"name":"Projects of International (Regional) Cooperation and Exchanges","award":["71411130215"],"award-info":[{"award-number":["71411130215"]}]},{"name":"Specialized Research Fund for the Doctoral Program of Higher Education","award":["20133706110002"],"award-info":[{"award-number":["20133706110002"]}]},{"name":"National Natural Science Foundation of ChinaNational Natural Science Foundation of China","award":["11301410"],"award-info":[{"award-number":["11301410"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11401386"],"award-info":[{"award-number":["11401386"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China (CN)","doi-asserted-by":"publisher","award":["11501316"],"award-info":[{"award-number":["11501316"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China (CN)","doi-asserted-by":"publisher","award":["71571108"],"award-info":[{"award-number":["71571108"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s10878-015-9954-y","type":"journal-article","created":{"date-parts":[[2015,9,16]],"date-time":"2015-09-16T06:56:59Z","timestamp":1442386619000},"page":"265-274","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Total coloring of planar graphs without adjacent short cycles"],"prefix":"10.1007","volume":"33","author":[{"given":"Huijuan","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongwei","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,16]]},"reference":[{"key":"9954_CR1","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0166-218X(00)00358-9","volume":"114","author":"VA Bojarshinov","year":"2001","unstructured":"Bojarshinov VA (2001) Edge and total coloring of interal graphs. Discret Appl Math 114:23\u201328","journal-title":"Discret Appl Math"},{"key":"9954_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph theory with applications","author":"JA Bondy","year":"1976","unstructured":"Bondy JA, Murty USR (1976) Graph theory with applications. MacMillan, London"},{"key":"9954_CR3","doi-asserted-by":"crossref","first-page":"2778","DOI":"10.1016\/j.dam.2009.02.011","volume":"157","author":"DZ Du","year":"2009","unstructured":"Du DZ, Shen L, Wang YQ (2009) Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable. Discret Appl Math 157:2778\u20132784","journal-title":"Discret Appl Math"},{"key":"9954_CR4","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0012-365X(95)00286-6","volume":"162","author":"AV Kostochka","year":"1996","unstructured":"Kostochka AV (1996) The total chromatic number of any multigraph with maximum degree five is at most seven. Discret Math 162:199\u2013214","journal-title":"Discret Math"},{"key":"9954_CR5","doi-asserted-by":"crossref","first-page":"1462","DOI":"10.1137\/070688389","volume":"22","author":"L Kowalik","year":"2008","unstructured":"Kowalik L, Sereni J-S, S\u0306krekovski R (2008) Total-coloring of plane graphs with maximum degree nine. SIAM J Discret Math 22:1462\u20131479","journal-title":"SIAM J Discret Math"},{"key":"9954_CR6","doi-asserted-by":"crossref","first-page":"6035","DOI":"10.1016\/j.disc.2009.05.006","volume":"309","author":"B Liu","year":"2009","unstructured":"Liu B, Hou JF, Wu JL, Liu GZ (2009) Total colorings and list total colorings of planar graphs without intersecting 4-cycles. Discret Math 309:6035\u20136043","journal-title":"Discret Math"},{"key":"9954_CR7","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0012-365X(92)00058-Y","volume":"124","author":"CJH McDiarmid","year":"1994","unstructured":"McDiarmid CJH, Snchez-Arroyo A (1994) Total colorings regular bipartite graphs is NP-hard. Discret Math 124:155\u2013162","journal-title":"Discret Math"},{"key":"9954_CR8","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/j.ipl.2010.02.012","volume":"110","author":"N Roussel","year":"2010","unstructured":"Roussel N, Zhu X (2010) Total coloring of planar graphs of maximum degree eight. Inf Process Lett 110:321\u2013324","journal-title":"Inf Process Lett"},{"key":"9954_CR9","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0012-365X(89)90187-8","volume":"78","author":"A Sanchez-Arroyo","year":"1989","unstructured":"Sanchez-Arroyo A (1989) Determing the total colouring number is NP-hard. Discret Math 78:315\u2013319","journal-title":"Discret Math"},{"key":"9954_CR10","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1002\/(SICI)1097-0118(199905)31:1<67::AID-JGT6>3.0.CO;2-C","volume":"31","author":"DP Sanders","year":"1999","unstructured":"Sanders DP, Zhao Y (1999) On total 9-coloring planar graphs of maximum degree seven. J Graph Theory 31:67\u201373","journal-title":"J Graph Theory"},{"key":"9954_CR11","doi-asserted-by":"crossref","first-page":"1733","DOI":"10.1007\/s11425-008-0155-3","volume":"52","author":"L Shen","year":"2009","unstructured":"Shen L, Wang YQ (2009) Total colorings of planar graphs with maximum degree at least 8. Sci China Ser A 52:1733\u20131742","journal-title":"Sci China Ser A"},{"key":"9954_CR12","unstructured":"Tan X, Chen HY, Wu JL (2009) Total colorings of planar graphs without adjacent 4-cycles. In: The eighth international symposium on operations research and its applications (ISORA\u201909), 167\u2013173"},{"key":"9954_CR13","doi-asserted-by":"publisher","unstructured":"Wang GH, Yan GY, Yu JG, Zhang X (2013) The $$r$$ r -acyclic chromatic number of planar graphs. J Comb Optim. doi: 10.1007\/s10878-013-9680-2","DOI":"10.1007\/s10878-013-9680-2"},{"key":"9954_CR14","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.tcs.2013.12.006","volume":"522","author":"HJ Wang","year":"2014","unstructured":"Wang HJ, Wu LD, Wu WL (2014) Total coloring of planar graphs with maximum degree 8. Theor Comput Sci 522:54\u201361","journal-title":"Theor Comput Sci"},{"key":"9954_CR15","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1007\/s10898-013-0138-y","volume":"60","author":"HJ Wang","year":"2014","unstructured":"Wang HJ, Wu LD, Wu WL, Pardalos PM, Wu JL (2014) Minimum total coloring of planar graph. J Global Optim 60:777\u2013791","journal-title":"J Global Optim"},{"key":"9954_CR16","first-page":"215","volume":"73","author":"JL Wu","year":"2004","unstructured":"Wu JL (2004) Total coloring of series-parallel graphs. Ars Comb 73:215\u2013217","journal-title":"Ars Comb"},{"key":"9954_CR17","doi-asserted-by":"crossref","first-page":"6210","DOI":"10.1016\/j.disc.2007.11.044","volume":"308","author":"JL Wu","year":"2008","unstructured":"Wu JL, Wang P (2008) List-edge and list-total colorings of graphs embedded on hyperbolic surfaces. Discret Math 308:6210\u20136215","journal-title":"Discret Math"},{"key":"9954_CR18","doi-asserted-by":"crossref","unstructured":"Yap HP (1996) Total colorings of graphs. Lecture notes in mathematics, vol 1623. Springer-Verlag, Berlin","DOI":"10.1007\/BFb0092895"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9954-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9954-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9954-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9954-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,10]],"date-time":"2019-08-10T04:41:52Z","timestamp":1565412112000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9954-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,16]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["9954"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9954-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2015,9,16]]}}}