{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:56:24Z","timestamp":1750308984093,"version":"3.41.0"},"reference-count":0,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[1984,1,1]],"date-time":"1984-01-01T00:00:00Z","timestamp":441763200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGACT News"],"published-print":{"date-parts":[[1984,1]]},"abstract":"<jats:p>Bounds are given on the number of colors required to color the edges of a graph (multigraph) such that each color appears at each vertex v at most m(v) times. The known results and proofs generalize in natural ways. Certain new edge-coloring problems, which have no counterparts when m(v) = 1 for all v\u03b5V, are studied.<\/jats:p>","DOI":"10.1145\/1008939.1008944","type":"journal-article","created":{"date-parts":[[2004,10,12]],"date-time":"2004-10-12T15:20:46Z","timestamp":1097594446000},"page":"60-60","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Midwest theory of computation symposium"],"prefix":"10.1145","volume":"15","author":[{"given":"S. Louis","family":"Hakimi","sequence":"first","affiliation":[{"name":"Northwestern University, Evanston, Illinois"}]},{"given":"Oded","family":"Kariv","sequence":"additional","affiliation":[{"name":"Tel-Aviv Israel"}]}],"member":"320","published-online":{"date-parts":[[1984,1]]},"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1008939.1008944","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1008939.1008944","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:41:08Z","timestamp":1750282868000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1008939.1008944"}},"subtitle":["on a generalization of edge-coloring in graphs"],"short-title":[],"issued":{"date-parts":[[1984,1]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1984,1]]}},"alternative-id":["10.1145\/1008939.1008944"],"URL":"https:\/\/doi.org\/10.1145\/1008939.1008944","relation":{},"ISSN":["0163-5700"],"issn-type":[{"type":"print","value":"0163-5700"}],"subject":[],"published":{"date-parts":[[1984,1]]},"assertion":[{"value":"1984-01-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}