{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:44:55Z","timestamp":1774417495724,"version":"3.50.1"},"reference-count":5,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1979,10,1]],"date-time":"1979-10-01T00:00:00Z","timestamp":307584000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1979,10]]},"DOI":"10.1016\/0020-0190(79)90049-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"110-112","source":"Crossref","is-referenced-by-count":9,"title":["Linear algorithms for edge-coloring trees and unicyclic graphs"],"prefix":"10.1016","volume":"9","author":[{"given":"Sandra","family":"Mitchell","sequence":"first","affiliation":[]},{"given":"Stephen","family":"Hedetniemi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(79)90049-8_BIB1","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0012-365X(76)90139-4","article-title":"On small graphs critical with respect to edge-colorings","volume":"16","author":"Beineke","year":"1976","journal-title":"Discrete Math."},{"key":"10.1016\/0020-0190(79)90049-8_BIB2","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF00998632","article-title":"Using Euler partitions to edge color bipartite multigraphs","volume":"5","author":"Gabow","year":"1976","journal-title":"Internat. J. Comput. Information Sci."},{"key":"10.1016\/0020-0190(79)90049-8_BIB3","first-page":"286","article-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0020-0190(79)90049-8_BIB4","first-page":"25","article-title":"On the estimate of the chromatic number of a graph","volume":"3","author":"Vizing","year":"1964","journal-title":"Diskret. Analiz."},{"key":"10.1016\/0020-0190(79)90049-8_BIB5","series-title":"Introduction to Graph Theory","author":"Wilson","year":"1972"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019079900498?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019079900498?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:29:46Z","timestamp":1555086586000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019079900498"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,10]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1979,10]]}},"alternative-id":["0020019079900498"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(79)90049-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1979,10]]}}}