{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T22:07:19Z","timestamp":1775772439839,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1986,2,1]],"date-time":"1986-02-01T00:00:00Z","timestamp":507600000000},"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":10028,"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":[[1986,2]]},"DOI":"10.1016\/0095-8956(86)90065-1","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T14:37:08Z","timestamp":1107959828000},"page":"71-80","source":"Crossref","is-referenced-by-count":7,"title":["The chromatic index of nearly bipartite multigraphs"],"prefix":"10.1016","volume":"40","author":[{"given":"Larry","family":"Eggan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Plantholt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(86)90065-1_BIB1","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0012-365X(73)90023-X","article-title":"On the edge-chromatic number of a graph","volume":"5","author":"Beineke","year":"1973","journal-title":"Discrete Math."},{"key":"10.1016\/0095-8956(86)90065-1_BIB2","unstructured":"A. Chetwynd and A. J. W. Hilton, Partial edge-colourings of complete graphs or of graphs which are nearly complete, manuscript."},{"key":"10.1016\/0095-8956(86)90065-1_BIB3","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(86)90065-1_BIB4","series-title":"Combinatorial Mathematics and its Applications","first-page":"561","article-title":"Edge colorings in bipartite graphs","author":"Folkman","year":"1969"},{"key":"10.1016\/0095-8956(86)90065-1_BIB5","doi-asserted-by":"crossref","unstructured":"M. Goldberg, Edge-coloring of multigraphs; Recoloring technique,J. Graph Theory in press.","DOI":"10.1002\/jgt.3190080115"},{"key":"10.1016\/0095-8956(86)90065-1_BIB6","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/0210055","article-title":"The NP-completeness of edge-coloring","volume":"10","author":"Holyer","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0095-8956(86)90065-1_BIB7","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/BF01456961","article-title":"\u00dcber Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre","volume":"77","author":"K\u00f6nig","year":"1916","journal-title":"Math. Ann."},{"key":"10.1016\/0095-8956(86)90065-1_BIB8","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1093\/imamat\/9.1.23","article-title":"The solution of a time-tabling problem","volume":"9","author":"McDiarmid","year":"1972","journal-title":"J. Inst. Maths. Appl."},{"key":"10.1016\/0095-8956(86)90065-1_BIB9","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1112\/jlms\/s1-39.1.12","article-title":"Decomposition of finite graphs into forests","volume":"39","author":"Nash-Williams","year":"1964","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0095-8956(86)90065-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(86)90065-1_BIB11","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0012-365X(83)90074-2","article-title":"The chromatic index of graphs with large maximum degree","volume":"47","author":"Plantholt","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0095-8956(86)90065-1_BIB12","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1002\/jgt.3190090309","article-title":"A construction of chromatic index critical graphs from bipartite graphs","volume":"9","author":"Plantholt","year":"1985","journal-title":"J. Graph Theory"},{"key":"10.1016\/0095-8956(86)90065-1_BIB13","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1002\/sapm1949281148","article-title":"A theorem on coloring the lines of a network","volume":"28","author":"Shannon","year":"1949","journal-title":"J. Math. Phys."},{"key":"10.1016\/0095-8956(86)90065-1_BIB14","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. Anal."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895686900651?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895686900651?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:55:46Z","timestamp":1548777346000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895686900651"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,2]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1986,2]]}},"alternative-id":["0095895686900651"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(86)90065-1","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1986,2]]}}}