{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:20:02Z","timestamp":1761805202772},"reference-count":12,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,6,1]],"date-time":"1996-06-01T00:00:00Z","timestamp":833587200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6255,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1996,6]]},"DOI":"10.1016\/0012-365x(95)00034-t","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:36:38Z","timestamp":1027618598000},"page":"41-51","source":"Crossref","is-referenced-by-count":5,"title":["Total chromatic number of regular graphs of odd order and high degree"],"prefix":"10.1016","volume":"154","author":[{"given":"K.H.","family":"Chew","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(95)00034-T_BIB1","article-title":"Graphs and their chromatic numbers","author":"Behzad","year":"1965"},{"key":"10.1016\/0012-365X(95)00034-T_BIB2","series-title":"Graphs and Digraphs","author":"Chartrand","year":"1986"},{"key":"10.1016\/0012-365X(95)00034-T_BIB3","series-title":"Graph Colourings","first-page":"65","article-title":"Total colourings of graphs","author":"Chetwynd","year":"1990"},{"key":"10.1016\/0012-365X(95)00034-T_BIB4","first-page":"193","article-title":"Regular graphs of high degree are 1-factorizable","volume":"50","author":"Chetwynd","year":"1985"},{"key":"10.1016\/0012-365X(95)00034-T_BIB5","first-page":"195","article-title":"Some refinements of the total chromatic number conjecture","volume":"66","author":"Chetwynd","year":"1988"},{"key":"10.1016\/0012-365X(95)00034-T_BIB6","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0012-365X(89)90082-4","article-title":"1-factorizing regular graphs of high degree \u2014 an improved bound","volume":"75","author":"Chetwynd","year":"1989","journal-title":"Discrete Math."},{"issue":"2","key":"10.1016\/0012-365X(95)00034-T_BIB7","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1112\/jlms\/s2-44.2.193","article-title":"The total chromatic number of graphs of high minimum degree","volume":"44","author":"Chetwynd","year":"1991","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0012-365X(95)00034-T_BIB8","unstructured":"K.H. Chew, Total chromatic number of graphs of high maximum degree, J. Combin. Math. and Combin. Comput., to appear."},{"key":"10.1016\/0012-365X(95)00034-T_BIB9","first-page":"69","article-title":"Some theorems on abstract graphs","volume":"2","author":"Dirac","year":"1952"},{"key":"10.1016\/0012-365X(95)00034-T_BIB10","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0012-365X(93)90167-R","article-title":"Recent results on the total chromatic number","volume":"111","author":"Hilton","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(95)00034-T_BIB11","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0012-365X(93)90329-R","article-title":"The total chromatic number of graphs having large maximum degree","volume":"117","author":"Hilton","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(95)00034-T_BIB12","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1070\/RM1968v023n06ABEH001252","article-title":"Some unsolved problems in graph theory","volume":"23","author":"Vizing","year":"1968","journal-title":"Russian Math. Surveys"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500034T?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500034T?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:24:21Z","timestamp":1556130261000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9500034T"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,6]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,6]]}},"alternative-id":["0012365X9500034T"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(95)00034-t","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,6]]}}}