{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:51:51Z","timestamp":1764996711387},"reference-count":6,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"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":5890,"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":[[1997,6]]},"DOI":"10.1016\/s0012-365x(96)00124-0","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:23:46Z","timestamp":1051741426000},"page":"249-251","source":"Crossref","is-referenced-by-count":33,"title":["Covering a graph by complete bipartite graphs"],"prefix":"10.1016","volume":"170","author":[{"given":"P.","family":"Erd\u0151s","sequence":"first","affiliation":[]},{"given":"L.","family":"Pyber","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(96)00124-0_BIB1","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0304-3975(95)00065-8","article-title":"On the information rate of secret sharing schemes","volume":"154","author":"Blundo","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0012-365X(96)00124-0_BIB2","series-title":"Studies in Pure Mathematics","first-page":"95","article-title":"On the decomposition of graphs into complete bipartite subgraphs","author":"Chung","year":"1983"},{"key":"10.1016\/S0012-365X(96)00124-0_BIB3","first-page":"1","article-title":"Circuit coverings of graphs and a conjectur of Pyber","volume":"65","author":"Fan","year":"1995","journal-title":"JCT (B)"},{"key":"10.1016\/S0012-365X(96)00124-0_BIB4","doi-asserted-by":"crossref","first-page":"2495","DOI":"10.1002\/j.1538-7305.1971.tb02618.x","article-title":"On the addressing problem for loop switching","volume":"50","author":"Graham","year":"1971","journal-title":"Bell. System Tech. J."},{"key":"10.1016\/S0012-365X(96)00124-0_BIB5","series-title":"Sets, Graphs and Numbers","first-page":"583","article-title":"Covering the edges of a graph by \u2026","volume":"vol. 60","author":"Pyber","year":"1992"},{"key":"10.1016\/S0012-365X(96)00124-0_BIB6","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF02579163","article-title":"Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices","volume":"4","author":"Tuza","year":"1984","journal-title":"Combinatorica"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96001240?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96001240?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T19:26:56Z","timestamp":1553196416000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X96001240"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":6,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["S0012365X96001240"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00124-0","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}