{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T10:46:43Z","timestamp":1774954003478,"version":"3.50.1"},"reference-count":5,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1986,3,1]],"date-time":"1986-03-01T00:00:00Z","timestamp":510019200000},"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":10000,"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":[[1986,3]]},"DOI":"10.1016\/0012-365x(86)90142-1","type":"journal-article","created":{"date-parts":[[2003,1,17]],"date-time":"2003-01-17T12:34:03Z","timestamp":1042806843000},"page":"253-262","source":"Crossref","is-referenced-by-count":16,"title":["The chromatic number of graphs which induce neither K1,3 nor K5\u2212e"],"prefix":"10.1016","volume":"58","author":[{"given":"Henry A","family":"Kierstead","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James H","family":"Schmerl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(86)90142-1_BIB1","doi-asserted-by":"crossref","first-page":"161","DOI":"10.7146\/math.scand.a-11685","article-title":"On edge-colourings of graphs","volume":"40","author":"Andersen","year":"1977","journal-title":"Math. Scand."},{"key":"10.1016\/0012-365X(86)90142-1_BIB2","series-title":"Beitr\u00e4ge zur Graphentheorie","first-page":"17","article-title":"Derived graphs and digraphs","author":"Beineke","year":"1968"},{"key":"10.1016\/0012-365X(86)90142-1_BIB3","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0012-365X(82)90052-8","article-title":"Improvement on Brooks' chromatic bound for a class of graphs","volume":"42","author":"Dhurandhar","year":"1982","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(86)90142-1_BIB4","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0095-8956(84)90022-4","article-title":"On the chromatic index of multigraphs without large triangles","volume":"36","author":"Kierstead","year":"1984","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(86)90142-1_BIB5","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0012-365X(83)90043-2","article-title":"Some applications of Vizing's theorem to vertex colorings of graphs","volume":"45","author":"Kierstead","year":"1983","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X86901421?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X86901421?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T07:52:46Z","timestamp":1553932366000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X86901421"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,3]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1986,3]]}},"alternative-id":["0012365X86901421"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(86)90142-1","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1986,3]]}}}