{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T22:05:55Z","timestamp":1767996355595,"version":"3.49.0"},"reference-count":21,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1993,7,1]],"date-time":"1993-07-01T00:00:00Z","timestamp":741484800000},"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":7321,"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":[[1993,7]]},"DOI":"10.1016\/0012-365x(93)90329-r","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:34Z","timestamp":1027640614000},"page":"127-140","source":"Crossref","is-referenced-by-count":30,"title":["The total chromatic number of graphs having large maximum degree"],"prefix":"10.1016","volume":"117","author":[{"given":"A.J.W.","family":"Hilton","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.R.","family":"Hind","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(93)90329-R_BIB1","series-title":"Ph.D. Thesis","article-title":"Graphs and their chromatic numbers","author":"Behzad","year":"1965"},{"key":"10.1016\/0012-365X(93)90329-R_BIB2","first-page":"225","article-title":"The colour numbers of complete graphs","volume":"42","author":"Behzad","year":"1967","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0012-365X(93)90329-R_BIB3","series-title":"Extremal Graph Theory","author":"Bollob\u00e1s","year":"1978"},{"key":"10.1016\/0012-365X(93)90329-R_BIB4","series-title":"Graph Theory: An Introductory Course","author":"Bollob\u00e1s","year":"1979"},{"key":"10.1016\/0012-365X(93)90329-R_BIB5","series-title":"Graph Colourings","first-page":"65","article-title":"Total colourings of graphs","author":"Chetwynd","year":"1990"},{"key":"10.1016\/0012-365X(93)90329-R_BIB6","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0095-8956(90)90129-N","article-title":"The edge-chromatic class of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small","volume":"48","author":"Chetwynd","year":"1990","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"10.1016\/0012-365X(93)90329-R_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(93)90329-R_BIB8","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0012-365X(91)90094-I","article-title":"Hamiltonism, degree sums and neighborhood conditions","volume":"90","author":"Flandrin","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(93)90329-R_BIB9","series-title":"Combinatorial Theory and its Applications II","first-page":"601","article-title":"Proof of a conjecture of P. Erd\u0151s","volume":"Vol. 4","author":"Hajnal","year":"1970"},{"key":"10.1016\/0012-365X(93)90329-R_BIB10","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01787726","article-title":"An upper bound for the total chromatic number","volume":"6","author":"Hind","year":"1990","journal-title":"Graphs and Combin."},{"key":"10.1016\/0012-365X(93)90329-R_BIB11","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1002\/jgt.3190160302","article-title":"An upper bound for the total chromatic number of dense graphs","volume":"16","author":"Hind","year":"1992","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(93)90329-R_BIB12","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0012-365X(77)90146-7","article-title":"The total colouring of a multigraph with maximal degree 4","volume":"17","author":"Kostochka","year":"1977","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(93)90329-R_BIB13","first-page":"13","article-title":"An analogue of Shannon's estimate for complete colorings (Russian)","volume":"30","author":"Kostochka","year":"1977","journal-title":"Diskret. Analiz."},{"key":"10.1016\/0012-365X(93)90329-R_BIB14","first-page":"33","article-title":"Exact upper bound for the total chromatic number of a graph (Russian)","author":"Kostochka","year":"1979","journal-title":"Theorie der Graphen und Netwerke"},{"key":"10.1016\/0012-365X(93)90329-R_BIB15","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\/0012-365X(93)90329-R_BIB16","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0012-365X(89)90187-8","article-title":"Determining the total chromatic number is NP-hard","volume":"78","author":"Sanchez-Arroyo","year":"1989","journal-title":"Discrete Math."},{"issue":"2","key":"10.1016\/0012-365X(93)90329-R_BIB17","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1112\/jlms\/s2-3.3.405","article-title":"On total chromatic number of graph","volume":"3","author":"Vijayaditya","year":"1971","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0012-365X(93)90329-R_BIB18","first-page":"23","article-title":"On an estimate of the chromatic class of a p-graph (Russian)","volume":"3","author":"Vizing","year":"1964","journal-title":"Diskret. Analiz."},{"key":"10.1016\/0012-365X(93)90329-R_BIB19","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\/0012-365X(93)90329-R_BIB20","article-title":"On the total chromatic number of a graph","author":"Yap","year":"1988","journal-title":"Research Report No. 343"},{"key":"10.1016\/0012-365X(93)90329-R_BIB21","unstructured":"H.P. Yap, Wang Jian-Fang and Zhang Zhongfu, Total chromatic number of graphs of high degree, J. Australian Math. Soc., to appear."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9390329R?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9390329R?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:54:34Z","timestamp":1555120474000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9390329R"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":21,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["0012365X9390329R"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(93)90329-r","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}