{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:15Z","timestamp":1740122415607,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,9,3]],"date-time":"2016-09-03T00:00:00Z","timestamp":1472860800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11501316","71171120"],"award-info":[{"award-number":["11501316","71171120"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71571108"],"award-info":[{"award-number":["71571108"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"State Scholarship Fund of China","award":["201506335016"],"award-info":[{"award-number":["201506335016"]}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2015M570568","2016T90607"],"award-info":[{"award-number":["2015M570568","2016T90607"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2014AQ001","ZR2015GZ007"],"award-info":[{"award-number":["ZR2014AQ001","ZR2015GZ007"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2015FM023"],"award-info":[{"award-number":["ZR2015FM023"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Qingdao Postdoctoral Application Research Project","award":["2015170"],"award-info":[{"award-number":["2015170"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s10878-016-0063-3","type":"journal-article","created":{"date-parts":[[2016,9,2]],"date-time":"2016-09-02T20:41:34Z","timestamp":1472848894000},"page":"257-265","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Total coloring of planar graphs without adjacent chordal 6-cycles"],"prefix":"10.1007","volume":"34","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":"Xiaoli","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guangmo","family":"Tong","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":[[2016,9,3]]},"reference":[{"key":"63_CR1","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":"63_CR2","unstructured":"Behzad M (1965) Graphs and their chromatic numbers. Ph.D. Thesis, Michigan State University"},{"key":"63_CR3","first-page":"180","volume":"394","author":"OV Borodin","year":"1989","unstructured":"Borodin OV (1989) On the total coloring of planar graphs. J Reine Angew Math 394:180\u2013185","journal-title":"J Reine Angew Math"},{"key":"63_CR4","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1002\/(SICI)1097-0118(199709)26:1<53::AID-JGT6>3.0.CO;2-G","volume":"26","author":"OV Borodin","year":"1997","unstructured":"Borodin OV, Kostochka AV, Woodall DR (1997) Total colorings of planar graphs with large maximum degree. J Graph Theory 26:53\u201359","journal-title":"J Graph Theory"},{"key":"63_CR5","doi-asserted-by":"crossref","first-page":"1650","DOI":"10.1007\/s10878-015-9859-9","volume":"31","author":"H Cai","year":"2016","unstructured":"Cai H, Wu JL, Sun L (2016) Total coloring of planar graphs without short cycles. J Comb Optim 31:1650\u20131664","journal-title":"J Comb Optim"},{"key":"63_CR6","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1016\/j.dam.2011.01.001","volume":"159","author":"GJ Chang","year":"2011","unstructured":"Chang GJ, Hou JF, Roussel N (2011) Local condition for planar graphs of maximum degree 7 to be 8-totally colorable. Discret Appl Math 159:760\u2013768","journal-title":"Discret Appl Math"},{"key":"63_CR7","first-page":"6035","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 \n                        $$9$$\n                        \n                            \n                                            \n                                \n                                    9\n                                \n                            \n                        \n                    -total-colorable. Discret Appl Math 157:6035\u20136043","journal-title":"Discret Appl Math"},{"key":"63_CR8","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/j.dam.2010.08.025","volume":"159","author":"JF Hou","year":"2011","unstructured":"Hou JF, Liu B, Liu GZ, Wu JL (2011) Total colorings of planar graphs without 6-cycles. Discret Appl Math 159:157\u2013163","journal-title":"Discret Appl Math"},{"key":"63_CR9","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":"63_CR10","doi-asserted-by":"crossref","first-page":"1462","DOI":"10.1137\/070688389","volume":"22","author":"L Kowalik","year":"2008","unstructured":"Kowalik L, Sereni JS, 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":"63_CR11","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1007\/s10878-013-9660-6","volume":"30","author":"H Li","year":"2015","unstructured":"Li H, Ding L, Liu B, Wang G (2015) Neighbor sum distinguishing total colorings of planar graphs. J Comb Optim 30:675\u2013688","journal-title":"J Comb Optim"},{"key":"63_CR12","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":"63_CR13","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/j.tcs.2015.09.017","volume":"609","author":"C Qu","year":"2016","unstructured":"Qu C, Wang G, Wu J, Yu X (2016) On the neighbor sum distinguishing total coloring of planar graphs. Theor Comput Sci 609:162\u2013170","journal-title":"Theor Comput Sci"},{"key":"63_CR14","doi-asserted-by":"publisher","unstructured":"Qu C, Wang G, Yan G, Yu X (2015) Neighbor sum distinguishing total choosability of planar graphs. J Comb Optim. doi:\n                        10.1007\/s10878-015-9911-9","DOI":"10.1007\/s10878-015-9911-9"},{"key":"63_CR15","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"},{"issue":"8","key":"63_CR16","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(8):1733\u20131742","journal-title":"Sci China Ser A"},{"key":"63_CR17","first-page":"117","volume":"23","author":"VG Vizing","year":"1968","unstructured":"Vizing VG (1968) Some unsolved problems in graph theory. Uspekhi Mat Nauk 23:117\u2013134 (in Russian)","journal-title":"Uspekhi Mat Nauk"},{"key":"63_CR18","doi-asserted-by":"crossref","first-page":"2025","DOI":"10.1016\/j.disc.2011.05.038","volume":"311","author":"B Wang","year":"2011","unstructured":"Wang B, Wu JL (2011) Total coloring of planar graphs with maximum degree seven and without intersecting 3-cycles. Discret Math 311:2025\u20132030","journal-title":"Discret Math"},{"key":"63_CR19","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1016\/j.dam.2014.02.004","volume":"171","author":"B Wang","year":"2014","unstructured":"Wang B, Wu JL, Wang HJ (2014) Total coloring of planar graphs without chordal \n                        $$6$$\n                        \n                            \n                                            \n                                \n                                    6\n                                \n                            \n                        \n                    -cycles. Discret Appl Math 171:116\u2013121","journal-title":"Discret Appl Math"},{"key":"63_CR20","doi-asserted-by":"publisher","unstructured":"Wang HJ, Liu B, Gu Y, Zhang X, Wu WL, Gao HW (2015) Total coloring of planar graphs without adjacent short cycles, J Comb Optim. doi:\n                        10.1007\/s10878-015-9954-y","DOI":"10.1007\/s10878-015-9954-y"},{"key":"63_CR21","doi-asserted-by":"crossref","first-page":"967","DOI":"10.1007\/s10114-016-5427-1","volume":"32","author":"HJ Wang","year":"2016","unstructured":"Wang HJ, Luo ZY, Liu B, Gu Y, Gao HW (2016) A note on the minimum total coloring of planar graphs. Acta Math Sin Engl Ser 32:967\u2013974","journal-title":"Acta Math Sin Engl Ser"},{"key":"63_CR22","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 Glob Optim 60:777\u2013791","journal-title":"J Glob Optim"},{"key":"63_CR23","first-page":"125","volume":"24","author":"P Wang","year":"2004","unstructured":"Wang P, Wu JL (2004) A note on the total colorings of planar graphs without \n                        $$4$$\n                        \n                            \n                                            \n                                \n                                    4\n                                \n                            \n                        \n                    -cycles. Discret Math 24:125\u2013135","journal-title":"Discret Math"},{"key":"63_CR24","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1002\/jgt.20195","volume":"54","author":"W Wang","year":"2007","unstructured":"Wang W (2007) Total chromatic number of planar graphs with maximum degree ten. J Graph Theory 54:91\u2013102","journal-title":"J Graph Theory"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-016-0063-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0063-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0063-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0063-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,9]],"date-time":"2017-06-09T03:11:55Z","timestamp":1496977915000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-016-0063-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,3]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["63"],"URL":"https:\/\/doi.org\/10.1007\/s10878-016-0063-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2016,9,3]]}}}