{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:05:09Z","timestamp":1763456709993},"reference-count":8,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1978,1,1]],"date-time":"1978-01-01T00:00:00Z","timestamp":252460800000},"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":12981,"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":[[1978]]},"DOI":"10.1016\/0012-365x(78)90004-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:33:13Z","timestamp":1027654393000},"page":"229-233","source":"Crossref","is-referenced-by-count":11,"title":["An edge-coloration theorem for bipartite graphs with applications"],"prefix":"10.1016","volume":"23","author":[{"given":"Ram Prakash","family":"Gupta","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(78)90004-3_BIB1","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0012-365X(78)90004-3_BIB2","series-title":"Theorie des Graphes Rome I.C.C.","first-page":"135","article-title":"A decomposition theorem for bipartite graphs","author":"Gupta","year":"1967"},{"key":"10.1016\/0012-365X(78)90004-3_BIB3","series-title":"Thesis","article-title":"Studies in the theory of graphs","author":"Gupta","year":"1967"},{"issue":"3","key":"10.1016\/0012-365X(78)90004-3_BIB4","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1090\/S0002-9904-1974-13468-3","article-title":"On decompositions of a multigraph into spanning subgraphs","volume":"80","author":"Gupta","year":"1974","journal-title":"Bull. Am. Math. Soc."},{"key":"10.1016\/0012-365X(78)90004-3_BIB5","author":"K\u00f6nig","year":"1935","journal-title":"Theorie der endlichen und unendlichen Graphen"},{"key":"10.1016\/0012-365X(78)90004-3_BIB6","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/S0021-9800(70)80033-3","article-title":"Subgraphs with prescribed valencies","volume":"8","author":"Lov\u00e1sz","year":"1970","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/0012-365X(78)90004-3_BIB7","article-title":"Theory of Graphs","volume":"38","author":"Ore","year":"1962"},{"key":"10.1016\/0012-365X(78)90004-3_BIB8","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02392606","article-title":"Die Theorie der regularen Graphen","volume":"15","author":"Petersen","year":"1891","journal-title":"Acta Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X78900043?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X78900043?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T11:21:47Z","timestamp":1555154507000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X78900043"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1978]]}},"alternative-id":["0012365X78900043"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(78)90004-3","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1978]]}}}