{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T10:43:47Z","timestamp":1757587427716},"reference-count":19,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,7,1]],"date-time":"1999-07-01T00:00:00Z","timestamp":930787200000},"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":5130,"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":[[1999,7]]},"DOI":"10.1016\/s0012-365x(99)00034-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:35:45Z","timestamp":1027618545000},"page":"39-46","source":"Crossref","is-referenced-by-count":2,"title":["Total chromatic number of graphs of odd order and high degree"],"prefix":"10.1016","volume":"205","author":[{"given":"K.H.","family":"Chew","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(99)00034-5_BIB1","unstructured":"M. Behzad, Graphs and their chromatic numbers, Doctoral Thesis, Michigan State University, 1965."},{"key":"10.1016\/S0012-365X(99)00034-5_BIB2","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1112\/jlms\/s1-42.1.226","article-title":"Jr., The colour numbers of complete graphs","volume":"42","author":"Behzad","year":"1967","journal-title":"J. London Math. Soc."},{"key":"10.1016\/S0012-365X(99)00034-5_BIB3","doi-asserted-by":"crossref","unstructured":"Bor-Liang Chen, Hung-Lin Fu, Total colorings of graphs of order 2n having maximum degree 2n\u22122, Graphs Combin. 8 (1992) 119\u2013123.","DOI":"10.1007\/BF02350630"},{"key":"10.1016\/S0012-365X(99)00034-5_BIB4","unstructured":"A.G. Chetwynd, Total colourings of graphs, in: R. Nelson, R.J. Wilson (Eds.), Graph colourings, Research Notes in Mathematics, No. 218, Pitman, Longman Scientific and Technical, London, 1990, pp. 65\u201378."},{"key":"10.1016\/S0012-365X(99)00034-5_BIB5","unstructured":"A.G. Chetwynd, A.J.W. Hilton, Some refinements of the total chromatic number conjecture, Congr. Numer. (1988) 195\u2013215."},{"key":"10.1016\/S0012-365X(99)00034-5_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\/S0012-365X(99)00034-5_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\/S0012-365X(99)00034-5_BIB8","unstructured":"K.H. Chew, Edge colourings and total colourings of graphs and multigraphs, Doctoral Thesis, University of New South Wales, 1994."},{"key":"10.1016\/S0012-365X(99)00034-5_BIB9","first-page":"245","article-title":"Total chromatic number of graphs of high maximum degree","volume":"18","author":"Chew","year":"1995","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/S0012-365X(99)00034-5_BIB10","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0012-365X(95)00034-T","article-title":"Total chromatic number of regular graphs of odd order and high degree","volume":"154","author":"Chew","year":"1996","journal-title":"Discrete Math."},{"issue":"3","key":"10.1016\/S0012-365X(99)00034-5_BIB11","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","article-title":"Some theorems on abstract graphs","volume":"2","author":"Dirac","year":"1952","journal-title":"Proc. London Math. Soc."},{"key":"10.1016\/S0012-365X(99)00034-5_BIB12","doi-asserted-by":"crossref","first-page":"3","DOI":"10.5486\/PMD.1962.9.1-2.02","article-title":"On the maximal number of disjoint circuits in a graph","volume":"9","author":"Erd\u00f6s","year":"1962","journal-title":"Publ. Math. Debrecen"},{"key":"10.1016\/S0012-365X(99)00034-5_BIB13","unstructured":"G.M. Hamilton, A.J.W. Hilton, H.R. Hind, Totally critical graphs and the conformability conjecture, Preprint."},{"key":"10.1016\/S0012-365X(99)00034-5_BIB14","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0012-365X(90)90031-C","article-title":"A total-chromatic number analogue of Plenatholt's theorem","volume":"79","author":"Hilton","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(99)00034-5_BIB15","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\/S0012-365X(99)00034-5_BIB16","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\/S0012-365X(99)00034-5_BIB17","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"},{"key":"10.1016\/S0012-365X(99)00034-5_BIB18","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1112\/jlms\/52.3.434","article-title":"Total chromatic number of graphs of odd order 2n+1 having maximum degree 2n\u22121","volume":"52","author":"Yap","year":"1995","journal-title":"J. London Math. Soc."},{"key":"10.1016\/S0012-365X(99)00034-5_BIB19","doi-asserted-by":"crossref","unstructured":"H.P. Yap, Total Colourings of Graphs, Lectures Notes in Mathematics, vol. 1623, Springer, Berlin, 1996.","DOI":"10.1007\/BFb0092895"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X99000345?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X99000345?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T04:15:51Z","timestamp":1681186551000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X99000345"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,7]]},"references-count":19,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,7]]}},"alternative-id":["S0012365X99000345"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(99)00034-5","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,7]]}}}