{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T19:20:17Z","timestamp":1767986417948,"version":"3.49.0"},"reference-count":8,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1988,6,1]],"date-time":"1988-06-01T00:00:00Z","timestamp":581126400000},"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":9177,"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":[[1988,6]]},"DOI":"10.1016\/0095-8956(88)90046-9","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T14:37:08Z","timestamp":1107959828000},"page":"372-376","source":"Crossref","is-referenced-by-count":17,"title":["Class one graphs"],"prefix":"10.1016","volume":"44","author":[{"given":"D.G","family":"Hoffman","sequence":"first","affiliation":[]},{"given":"C.A","family":"Rodger","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(88)90046-9_BIB1","author":"Bondy","year":"1976"},{"key":"10.1016\/0095-8956(88)90046-9_BIB2","article-title":"The chromatic index of graphs with at most four vertices of maximum degree","volume":"43","author":"Chetwynd","year":"1984"},{"key":"10.1016\/0095-8956(88)90046-9_BIB3","doi-asserted-by":"crossref","unstructured":"A. G. Chetwynd, A. J. W. Hilton, and D. G. Hoffman, On the \u0394-subgraph of graphs which are critical with respect to the chromatic index, J. Combin. Theory Ser. B, to appear.","DOI":"10.1016\/0095-8956(89)90045-2"},{"key":"10.1016\/0095-8956(88)90046-9_BIB4","article-title":"Edge-Colourings of Graphs","volume":"Vol. 16","author":"Fiorini","year":"1977"},{"key":"10.1016\/0095-8956(88)90046-9_BIB5","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(88)90046-9_BIB6","first-page":"437","article-title":"M\u00e9thode et th\u00e9or\u00e8me g\u00e9n\u00e9ral de coloration des ar\u00eates, d'un multigraph","volume":"56","author":"Fournier","year":"1977","journal-title":"J. Math. Pures Appl."},{"key":"10.1016\/0095-8956(88)90046-9_BIB7","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/0210055","article-title":"The NP-completeness of edge-colouring","volume":"10","author":"Holyer","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0095-8956(88)90046-9_BIB8","first-page":"25","article-title":"On an estimate of the chromatic class of a p-graph","volume":"3","author":"Vizing","year":"1964","journal-title":"Disket. Analiz."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895688900469?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895688900469?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:54:13Z","timestamp":1548777253000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895688900469"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,6]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1988,6]]}},"alternative-id":["0095895688900469"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(88)90046-9","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1988,6]]}}}