{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:42:51Z","timestamp":1710351771040},"reference-count":3,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1977,1,1]],"date-time":"1977-01-01T00:00:00Z","timestamp":220924800000},"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":13346,"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":[[1977]]},"DOI":"10.1016\/0012-365x(77)90102-9","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":12,"title":["On total matching numbers and total covering numbers of complementary graphs"],"prefix":"10.1016","volume":"19","author":[{"given":"P.","family":"Erd\u00f6s","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Meir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(77)90102-9_BIB1","doi-asserted-by":"crossref","unstructured":"Y. Alavi, M. Behzad, L.M. Lesniak and E.A. Nordhaus, Total matchings and total coverings of graphs, J. Graph Theory (to appear).","DOI":"10.1002\/jgt.3190010209"},{"key":"10.1016\/0012-365X(77)90102-9_BIB2","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1111\/j.2164-0947.1974.tb01571.x","article-title":"On the independence number of complementary graphs","volume":"36","author":"Chartrand","year":"1974","journal-title":"Trans. New York Acad. Sci. Ser."},{"key":"10.1016\/0012-365X(77)90102-9_BIB3","doi-asserted-by":"crossref","unstructured":"A. Meir, On total covering and matching of graphs, J. Combinatorial Theory Ser. B.(to appear).","DOI":"10.1016\/0095-8956(78)90017-5"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X77901029?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X77901029?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T10:58:35Z","timestamp":1555153115000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X77901029"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977]]},"references-count":3,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1977]]}},"alternative-id":["0012365X77901029"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(77)90102-9","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1977]]}}}