{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T15:05:36Z","timestamp":1695654336695},"reference-count":4,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1978,12,1]],"date-time":"1978-12-01T00:00:00Z","timestamp":281318400000},"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":12647,"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":[[1978,12]]},"DOI":"10.1016\/0095-8956(78)90004-7","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T09:37:08Z","timestamp":1107941828000},"page":"290-294","source":"Crossref","is-referenced-by-count":3,"title":["Partitioning the edges of a graph"],"prefix":"10.1016","volume":"25","author":[{"given":"A.J.W","family":"Hilton","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rhys Price","family":"Jones","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(78)90004-7_BIB1","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1112\/jlms\/s2-12.1.123","article-title":"Colouring the edges of a multigraph so that each vertex has at most j, or at least j, edges of each colour on it","volume":"12","author":"Hilton","year":"1975","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0095-8956(78)90004-7_BIB2","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0095-8956(78)90029-1","article-title":"Further remarks on partitioning the edges of a graph","volume":"24","author":"Hilton","year":"1978","journal-title":"J. Combinatorial Theory B"},{"key":"10.1016\/0095-8956(78)90004-7_BIB3","article-title":"Partition numbers of graphs","author":"Jones","year":"1973"},{"issue":"No. 3","key":"10.1016\/0095-8956(78)90004-7_BIB4","first-page":"25","article-title":"On an estimate of the chromatic number of a p-graph","author":"Vizing","year":"1960","journal-title":"Diskret. Analiz."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895678900047?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895678900047?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T11:25:59Z","timestamp":1548761159000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895678900047"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,12]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1978,12]]}},"alternative-id":["0095895678900047"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(78)90004-7","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1978,12]]}}}