{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:44:29Z","timestamp":1774417469696,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,4,1]],"date-time":"1996-04-01T00:00:00Z","timestamp":828316800000},"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":6316,"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":[[1996,4]]},"DOI":"10.1016\/0012-365x(95)00191-x","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:55:41Z","timestamp":1052783741000},"page":"247-256","source":"Crossref","is-referenced-by-count":4,"title":["A linear time algorithm for edge coloring of binomial trees"],"prefix":"10.1016","volume":"150","author":[{"given":"M.","family":"Kubale","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Piwakowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(95)00191-X_BIB1","doi-asserted-by":"crossref","first-page":"744","DOI":"10.1137\/0214054","article-title":"Scheduling file transfers in a distributed network","volume":"14","author":"Coffman","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(95)00191-X_BIB2","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1137\/0211043","article-title":"On edge coloring bipartite graphs","volume":"11","author":"Cole","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(95)00191-X_BIB3","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\/0012-365X(95)00191-X_BIB4","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1109\/TC.1985.1676647","article-title":"An approximation algorithm for diagnostic test scheduling in multicomputer systems","author":"Krawczyk","year":"1985","journal-title":"IEEE Trans. Comput. C-34"},{"key":"10.1016\/0012-365X(95)00191-X_BIB5","first-page":"505","article-title":"Interval edge-coloring of caterpillars with hairs of arbitrary length","volume":"19","author":"Kubale","year":"1987","journal-title":"Zast. Mat."},{"key":"10.1016\/0012-365X(95)00191-X_BIB6","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/0020-0190(79)90049-8","article-title":"Linear algorithms for edge coloring trees and unicyclic graphs","volume":"9","author":"Mitchell","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0012-365X(95)00191-X_BIB7","first-page":"475","article-title":"Application of a Boltzmann machine to timetable design","volume":"4","author":"Piwakowski","year":"1994","journal-title":"Appl. Math. Comp. Sci."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500191X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500191X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:23:19Z","timestamp":1556130199000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9500191X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,4]]},"references-count":7,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,4]]}},"alternative-id":["0012365X9500191X"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(95)00191-x","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,4]]}}}