{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T18:41:26Z","timestamp":1648924886961},"reference-count":9,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1995,3,1]],"date-time":"1995-03-01T00:00:00Z","timestamp":794016000000},"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":6713,"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,3]]},"DOI":"10.1016\/0012-365x(94)00219-9","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:25:26Z","timestamp":1049736326000},"page":"375-377","source":"Crossref","is-referenced-by-count":0,"title":["A new upper bound for total colourings of graphs"],"prefix":"10.1016","volume":"138","author":[{"given":"Abd\u00f3n","family":"S\u00e1nchez-Arroyo","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(94)00219-9_BIB1","article-title":"Graphs and their chromatic numbers","author":"Behzad","year":"1965"},{"key":"10.1016\/0012-365X(94)00219-9_BIB2","series-title":"Combinatorial Mathematics and its Applications","first-page":"1","article-title":"The total chromatic number of a graph: a survey","author":"Behzad","year":"1971"},{"key":"10.1016\/0012-365X(94)00219-9_BIB3","series-title":"Graphs Colourings","first-page":"65","article-title":"Total colourings","author":"Chetwynd","year":"1990"},{"key":"10.1016\/0012-365X(94)00219-9_BIB4","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01787726","article-title":"An improved bound for the total chromatic number of a graph","volume":"6","author":"Hind","year":"1990","journal-title":"Graphs Combin."},{"key":"10.1016\/0012-365X(94)00219-9_BIB5","series-title":"Graphs Colourings","first-page":"79","article-title":"Colourings of random graphs","author":"McDiarmid","year":"1990"},{"key":"10.1016\/0012-365X(94)00219-9_BIB6","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1006\/jctb.1993.1010","article-title":"On total colourings of graphs","volume":"57","author":"McDiarmid","year":"1993","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(94)00219-9_BIB7","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/0012-365X(93)90175-S","article-title":"An upper bound for total colourings of graphs","volume":"111","author":"McDiarmid","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(94)00219-9_BIB8_1","first-page":"117","article-title":"Some unsolved problems in graph theory (in Russian)","volume":"23","author":"Vizing","year":"1968","journal-title":"Uspekhi Math. Nauk."},{"key":"10.1016\/0012-365X(94)00219-9_BIB8_2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1070\/RM1968v023n06ABEH001252","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:0012365X94002199?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X94002199?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T01:24:18Z","timestamp":1555982658000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X94002199"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":9,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["0012365X94002199"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(94)00219-9","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,3]]}}}