{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T16:39:07Z","timestamp":1697647147176},"reference-count":8,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,12,1]],"date-time":"1996-12-01T00:00:00Z","timestamp":849398400000},"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":6072,"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":[[1996,12]]},"DOI":"10.1016\/0012-365x(95)00306-h","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:16:34Z","timestamp":1051114594000},"page":"77-91","source":"Crossref","is-referenced-by-count":2,"title":["The chromatic index of graphs of high maximum degree"],"prefix":"10.1016","volume":"162","author":[{"given":"K.H.","family":"Chew","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(95)00306-H_BIB1","first-page":"193","article-title":"Regular graphs of high degree are 1-factorizable","volume":"50","author":"Chetwynd","year":"1985"},{"key":"10.1016\/0012-365X(95)00306-H_BIB2","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."},{"key":"10.1016\/0012-365X(95)00306-H_BIB3","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0095-8956(89)90005-1","article-title":"A \u0394-subgraph condition for a graph to be class 1","volume":"46","author":"Chetwynd","year":"1989","journal-title":"J. Combin. Theory (B)"},{"key":"10.1016\/0012-365X(95)00306-H_BIB4","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0095-8956(90)90129-N","article-title":"The chromatic index 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 (B)"},{"key":"10.1016\/0012-365X(95)00306-H_BIB5","unstructured":"K.H. Chew, Total chromatic number of graphs of high maximum degree, J. Combin. Math. and Combin. Comput., to appear."},{"key":"10.1016\/0012-365X(95)00306-H_BIB6","article-title":"Edge-colourings of graphs","author":"Fiorini","year":"1977"},{"key":"10.1016\/0012-365X(95)00306-H_BIB7","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1002\/jgt.3190140211","article-title":"Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree","volume":"14","author":"Niessen","year":"1990","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(95)00306-H_BIB8","first-page":"9","article-title":"Critical graphs with a given chromatic class","volume":"5","author":"Vizing","year":"1965","journal-title":"Diskret. Analiz."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500306H?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500306H?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T14:26:24Z","timestamp":1556115984000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9500306H"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,12]]},"references-count":8,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,12]]}},"alternative-id":["0012365X9500306H"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(95)00306-h","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,12]]}}}