{"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":1774528912065,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2013,3,1]],"date-time":"2013-03-01T00:00:00Z","timestamp":1362096000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2017,3,11]],"date-time":"2017-03-11T00:00:00Z","timestamp":1489190400000},"content-version":"vor","delay-in-days":1471,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1016\/j.tcs.2013.01.015","type":"journal-article","created":{"date-parts":[[2013,1,31]],"date-time":"2013-01-31T17:04:51Z","timestamp":1359651891000},"page":"16-23","source":"Crossref","is-referenced-by-count":13,"special_numbering":"C","title":["Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords"],"prefix":"10.1016","volume":"476","author":[{"given":"Jian","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui-Juan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian-Liang","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong-Ga","family":"A","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2013.01.015_br000005","unstructured":"M. Behzad, Graphs and their chromatic numbers, Ph.D. Thesis, Michigan State University, 1965."},{"key":"10.1016\/j.tcs.2013.01.015_br000010","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/j.tcs.2013.01.015_br000015","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1002\/(SICI)1097-0118(199709)26:1<53::AID-JGT6>3.0.CO;2-G","article-title":"Total colorings of planar graphs with large maximum degree","volume":"26","author":"Borodin","year":"1997","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.tcs.2013.01.015_br000020","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1006\/eujc.1997.0152","article-title":"Total colorings of planar graphs with large girth","volume":"19","author":"Borodin","year":"1998","journal-title":"European J. Combin."},{"key":"10.1016\/j.tcs.2013.01.015_br000025","doi-asserted-by":"crossref","first-page":"2778","DOI":"10.1016\/j.dam.2009.02.011","article-title":"Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable","volume":"157","author":"Du","year":"2009","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2013.01.015_br000030","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s00373-008-0778-8","article-title":"Total colorings of planar graphs without small cycles","volume":"24","author":"Hou","year":"2008","journal-title":"Graphs Combin."},{"key":"10.1016\/j.tcs.2013.01.015_br000035","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0012-365X(95)00286-6","article-title":"The total chromatic number of any multigraph with maximum degree five is at most seven","volume":"162","author":"Kostochka","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/j.tcs.2013.01.015_br000040","doi-asserted-by":"crossref","first-page":"1462","DOI":"10.1137\/070688389","article-title":"Total-Coloring of plane graphs with maximum degree nine","volume":"22","author":"Kowalik","year":"2008","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.tcs.2013.01.015_br000045","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1002\/(SICI)1097-0118(199905)31:1<67::AID-JGT6>3.0.CO;2-C","article-title":"On total 9-coloring planar graphs of maximum degree seven","volume":"31","author":"Sanders","year":"1999","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.tcs.2013.01.015_br000050","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/s00373-009-0843-y","article-title":"On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles","volume":"25","author":"Shen","year":"2009","journal-title":"Graphs Combin."},{"key":"10.1016\/j.tcs.2013.01.015_br000055","first-page":"1356","article-title":"Total colorings of planar graphs with maximum degree at least 8","volume":"38","author":"Shen","year":"2008","journal-title":"Sci. China"},{"key":"10.1016\/j.tcs.2013.01.015_br000060","first-page":"117","article-title":"Some unsolved problems in graph theory","volume":"23","author":"Vizing","year":"1968","journal-title":"Uspekhi Mat. Nauk"},{"key":"10.1016\/j.tcs.2013.01.015_br000065","doi-asserted-by":"crossref","first-page":"1815","DOI":"10.1016\/j.dam.2012.03.027","article-title":"Total colorings of planar graphs without intersecting 5-cycles","volume":"160","author":"Wang","year":"2012","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2013.01.015_br000070","doi-asserted-by":"crossref","first-page":"1923","DOI":"10.1016\/j.disc.2012.02.026","article-title":"A note on the total coloring of planar graphs without adjacent 4-cycles","volume":"312","author":"Wang","year":"2012","journal-title":"Discrete Math."},{"key":"10.1016\/j.tcs.2013.01.015_br000075","doi-asserted-by":"crossref","first-page":"125","DOI":"10.7151\/dmgt.1219","article-title":"A note on total colorings of planar graphs without 4-cycles","volume":"24","author":"Wang","year":"2004","journal-title":"Discuss. Math. Graph Theory"},{"key":"10.1016\/j.tcs.2013.01.015_br000080","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1002\/jgt.20195","article-title":"Total chromatic number of planar graphs with maximum degree ten","volume":"54","author":"Wang","year":"2007","journal-title":"J. Graph Theory"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0304397513000650?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0304397513000650?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,18]],"date-time":"2018-10-18T22:23:15Z","timestamp":1539901395000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397513000650"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3]]},"references-count":16,"alternative-id":["S0304397513000650"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.tcs.2013.01.015","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2013,3]]}}}