{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:20:04Z","timestamp":1761805204634},"reference-count":15,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"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":6621,"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":[[1995,6]]},"DOI":"10.1016\/0012-365x(94)00291-p","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T18:23:46Z","timestamp":1051727026000},"page":"245-252","source":"Crossref","is-referenced-by-count":4,"title":["Generalization of two results of Hilton on total-colourings of a graph"],"prefix":"10.1016","volume":"140","author":[{"given":"H.P.","family":"Yap","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(94)00291-P_BIB1","article-title":"Graphs and their chromatic numbers","author":"Behzad","year":"1965"},{"issue":"2","key":"10.1016\/0012-365X(94)00291-P_BIB2","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1112\/jlms\/s2-9.2.279","article-title":"Nombre chromatique total du graphe r-parti complet","volume":"9","author":"Bermond","year":"1974","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0012-365X(94)00291-P_BIB3","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/BF02350630","article-title":"Total colorings of graphs of order 2n having maximum degree 2n \u2212 2","volume":"8","author":"Chen","year":"1992","journal-title":"Graphs Combin."},{"key":"10.1016\/0012-365X(94)00291-P_BIB4","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1002\/jgt.3190160608","article-title":"Total chromatic number and chromatic index of complete r-partite graphs","volume":"16","author":"Chew","year":"1992","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(94)00291-P_BIB5","unstructured":"J.K. Dugdale and A.J.W. Hilton, The total chromatic number of regular graphs whose complement is bipartite, preprint."},{"key":"10.1016\/0012-365X(94)00291-P_BIB6","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0012-365X(90)90031-C","article-title":"A total-chromatic number analogue of Plantholt's theorem","volume":"79","author":"Hilton","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(94)00291-P_BIB7","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0095-8956(91)90085-X","article-title":"The total chromatic number of nearly complete bipartite graphs","volume":"52","author":"Hilton","year":"1991","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(94)00291-P_BIB8","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0012-365X(93)90329-R","article-title":"Total chromatic number of graphs having large maximum degree","volume":"117","author":"Hilton","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(94)00291-P_BIB9","first-page":"25","article-title":"On an estimate of the chromatic class of a p-graph","volume":"3","author":"Vizing","year":"1964","journal-title":"Diskret. Analiz"},{"key":"10.1016\/0012-365X(94)00291-P_BIB10_1","first-page":"117","article-title":"Some unsolved problems in graph theory","volume":"23","author":"Vizing","year":"1968","journal-title":"Uspehi Mat. Nauk"},{"key":"10.1016\/0012-365X(94)00291-P_BIB10_2","first-page":"125","volume":"23","year":"1968","journal-title":"Russian Math. Survey"},{"key":"10.1016\/0012-365X(94)00291-P_BIB11","article-title":"Total colorings of graphs of high degree","author":"Wang","year":"1990"},{"key":"10.1016\/0012-365X(94)00291-P_BIB12","series-title":"Some Topics in Graph Theory","author":"Yap","year":"1986"},{"key":"10.1016\/0012-365X(94)00291-P_BIB13","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1112\/blms\/21.2.159","article-title":"Total colourings of graphs","volume":"21","author":"Yap","year":"1989","journal-title":"Bull. London Math. Soc"},{"key":"10.1016\/0012-365X(94)00291-P_BIB14","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1017\/S1446788700035801","article-title":"Total chromatic number of graphs of high degree II","volume":"53","author":"Yap","year":"1992","journal-title":"J. Australian Math. Soc. Ser. A"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9400291P?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9400291P?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T18:59:27Z","timestamp":1556650767000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9400291P"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":15,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["0012365X9400291P"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(94)00291-p","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,6]]}}}