{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T15:32:29Z","timestamp":1768318349244,"version":"3.49.0"},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"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":8598,"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":[[1990,1]]},"DOI":"10.1016\/0012-365x(90)90031-c","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:46:59Z","timestamp":1027655219000},"page":"169-175","source":"Crossref","is-referenced-by-count":21,"title":["A total-chromatic number analogue of plantholt's theorem"],"prefix":"10.1016","volume":"79","author":[{"given":"A.J.W.","family":"Hilton","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(90)90031-C_BIB1","series-title":"Doctoral Thesis","article-title":"Graphs and their chromatic numbers","author":"Behzad","year":"1965"},{"key":"10.1016\/0012-365X(90)90031-C_BIB2","series-title":"Graph Theory and Combinatorics","first-page":"81","article-title":"Partial edge-colourings of complete graphs, or of graphs which are nearly complete","author":"Chetwynd","year":"1984"},{"key":"10.1016\/0012-365X(90)90031-C_BIB3","author":"K\u00f6nig","year":"1950","journal-title":"Theorie der endlichen und unendlichen Graphen"},{"key":"10.1016\/0012-365X(90)90031-C_BIB4","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1002\/jgt.3190050103","article-title":"The chromatic index of graphs with a spanning star","volume":"5","author":"Plantholt","year":"1981","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(90)90031-C_BIB5","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(90)90031-C_BIB6","doi-asserted-by":"crossref","unstructured":"V.G. Vizing, Some unsolved problems in graph theory (in Russian), Uspekhi Math. Nauk. 23, 117-134.","DOI":"10.1070\/RM1968v023n06ABEH001252"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090031C?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090031C?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T16:31:28Z","timestamp":1681835488000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9090031C"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,1]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,1]]}},"alternative-id":["0012365X9090031C"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(90)90031-c","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,1]]}}}