{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:46:23Z","timestamp":1720640783491},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1016\/s1571-0653(04)00091-5","type":"journal-article","created":{"date-parts":[[2004,10,15]],"date-time":"2004-10-15T11:21:27Z","timestamp":1097839287000},"page":"468-477","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Total chromatic number of graphs with small genus"],"prefix":"10.1016","volume":"11","author":[{"given":"Rong","family":"Luo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cun-Quan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(04)00091-5_NEWBIB1","series-title":"Total coloring of simple graphs (in Danish), Master's thesis","author":"Andersen","year":"1993"},{"key":"10.1016\/S1571-0653(04)00091-5_NEWBIB2","unstructured":"M. Behzad, Graphs and their chromatic numbers, Doctoral thesis, Michigan State University, 1965."},{"key":"10.1016\/S1571-0653(04)00091-5_NEWBIB3","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1515\/crll.1989.394.180","article-title":"On the total coloring of planar graphs","volume":"394","author":"Borodin","year":"1989","journal-title":"J. Reine Angew math"},{"key":"10.1016\/S1571-0653(04)00091-5_NEWBIB4","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":"1998","journal-title":"J. Graph Theory"},{"key":"10.1016\/S1571-0653(04)00091-5_NEWBIB5","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":"Europ. J. Combinatorics"},{"key":"10.1016\/S1571-0653(04)00091-5_NEWBIB6","series-title":"Graph Coloring Problems","first-page":"86","article-title":"Total coloring,","author":"Jesen","year":"1995"},{"key":"10.1016\/S1571-0653(04)00091-5_NEWBIB7","unstructured":"A. V. Kostochka, Exact upper bound for the total chromatic number of a graph (in Russian), in Proc 24th Int Wiss Koll Tech Hochsch Ilmenau (1979), 33\u201336."},{"key":"10.1016\/S1571-0653(04)00091-5_NEWBIB8","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0012-365X(77)90146-7","article-title":"The total coloring of multigraph with maximal degree 4","volume":"17","author":"Kostochka","year":"1997","journal-title":"Discrete Math"},{"issue":"S\u00e9r. 19","key":"10.1016\/S1571-0653(04)00091-5_NEWBIB9","first-page":"27","article-title":"Quelques cons\u00e9quences simples de la formule d'Euler","volume":"9","author":"Lebesgue","year":"1940","journal-title":"J. de Math"},{"key":"10.1016\/S1571-0653(04)00091-5_NEWBIB10","series-title":"The Four-color Problem","article-title":"Euler's Formula and Its Consequences,","author":"Ore","year":"1967"},{"key":"10.1016\/S1571-0653(04)00091-5_NEWBIB11","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1007\/BF02771690","article-title":"On the total coloring of certain graphs","volume":"9","author":"Rosenfeld","year":"1971","journal-title":"Israel J math"},{"key":"10.1016\/S1571-0653(04)00091-5_NEWBIB12","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\/S1571-0653(04)00091-5_NEWBIB13","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1112\/jlms\/s2-3.3.405","article-title":"On total chromatic number of a graph","volume":"3","author":"Vijayaditya","year":"1971","journal-title":"J. London Math. Soc"},{"key":"10.1016\/S1571-0653(04)00091-5_NEWBIB14","first-page":"25","article-title":"On an estimate of the chromatic class of a p-graph (in Russian)","volume":"3","author":"Vizing","year":"1964","journal-title":"metidy Diskret Analiz"},{"key":"10.1016\/S1571-0653(04)00091-5_NEWBIB15","author":"Yap","year":"1989","journal-title":"Total-colourings of graphs manuscript"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304000915?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304000915?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,2]],"date-time":"2019-02-02T21:54:31Z","timestamp":1549144471000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304000915"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":15,"alternative-id":["S1571065304000915"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00091-5","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}