{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,27]],"date-time":"2023-08-27T06:34:48Z","timestamp":1693118088353},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,2,1]],"date-time":"1989-02-01T00:00:00Z","timestamp":602294400000},"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":8932,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1989,2]]},"DOI":"10.1016\/0095-8956(89)90005-1","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T14:37:08Z","timestamp":1107959828000},"page":"37-45","source":"Crossref","is-referenced-by-count":7,"title":["A \u0394-subgraph condition for a graph to be class 1"],"prefix":"10.1016","volume":"46","author":[{"given":"A.G","family":"Chetwynd","sequence":"first","affiliation":[]},{"given":"A.J.W","family":"Hilton","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(89)90005-1_BIB1","first-page":"303","article-title":"Star multigraphs with three vertices of maximum degree","volume":"100","author":"Chetwynd","year":"1986"},{"key":"10.1016\/0095-8956(89)90005-1_BIB2","doi-asserted-by":"crossref","unstructured":"A. G. Chetwynd and A. J. W. Hilton, The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small, J. Combin. Theory, to appear.","DOI":"10.1016\/0095-8956(90)90129-N"},{"key":"10.1016\/0095-8956(89)90005-1_BIB3","series-title":"Graph Theory and Combinatorics: Proc. Cambridge Conf. in Honour of Paul Erd\u00f6s","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\/0095-8956(89)90005-1_BIB4","first-page":"193","article-title":"Regular graphs of high degree are 1-factorizable","volume":"50","author":"Chetwynd","year":"1985"},{"key":"10.1016\/0095-8956(89)90005-1_BIB5","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1002\/jgt.3190080403","article-title":"The chromatic index of graphs of even order with many edges","volume":"8","author":"Chetwynd","year":"1984","journal-title":"J. Graph Theory"},{"key":"10.1016\/0095-8956(89)90005-1_BIB6","doi-asserted-by":"crossref","unstructured":"A. G. Chetwynd and A. J. W. Hilton, The edge-chromatic class of graphs with maximum degree at least |V| \u2212 3, Anals of Discrete Maths, to appear.","DOI":"10.1016\/S0167-5060(08)70453-9"},{"key":"10.1016\/0095-8956(89)90005-1_BIB7","unstructured":"A. G. Chetwynd and A. J. W. Hilton, The edge-chromatic class of graphs of even order with maximum degree at least |V| \u2212 4, in preparation."},{"key":"10.1016\/0095-8956(89)90005-1_BIB8","volume":"Vol. 16","author":"Fiorini","year":"1977"},{"key":"10.1016\/0095-8956(89)90005-1_BIB9","first-page":"311","article-title":"Colorations des ar\u00eates d'un graphe","volume":"15","author":"Fournier","year":"1973","journal-title":"Cahiers Centre \u00c9tudes Rech. Op\u00e9r."},{"key":"10.1016\/0095-8956(89)90005-1_BIB10","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\/0095-8956(89)90005-1_BIB11","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0012-365X(83)90074-2","article-title":"On the chromatic index of graphs with large maximum degree","volume":"47","author":"Plantholt","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0095-8956(89)90005-1_BIB12","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\/0095-8956(89)90005-1_BIB13","first-page":"9","article-title":"Critical graphs with a given chromatic class","volume":"5","author":"Vizing","year":"1965","journal-title":"Diskret. Analiz."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895689900051?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895689900051?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T15:53:29Z","timestamp":1548777209000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895689900051"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,2]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,2]]}},"alternative-id":["0095895689900051"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(89)90005-1","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1989,2]]}}}