{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T11:45:59Z","timestamp":1743767159160},"reference-count":9,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"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":3638,"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":[[2003,8]]},"DOI":"10.1016\/s0012-365x(02)00831-2","type":"journal-article","created":{"date-parts":[[2003,2,4]],"date-time":"2003-02-04T20:48:55Z","timestamp":1044391735000},"page":"115-125","source":"Crossref","is-referenced-by-count":11,"title":["Covering vertices of a graph by k disjoint cycles"],"prefix":"10.1016","volume":"270","author":[{"given":"Yoshimi","family":"Egawa","sequence":"first","affiliation":[]},{"given":"Mariko","family":"Hagita","sequence":"additional","affiliation":[]},{"given":"Ken-ichi","family":"Kawarabayashi","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Wang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(02)00831-2_BIB1","series-title":"Extremal Graph Theory","author":"Bollob\u00e1s","year":"1978"},{"key":"10.1016\/S0012-365X(02)00831-2_BIB2","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/BF01895727","article-title":"On the maximal number of independent circuits in a graph","volume":"14","author":"Corr\u00e1di","year":"1963","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"10.1016\/S0012-365X(02)00831-2_BIB3","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0012-365X(84)90050-5","article-title":"On circuits in graphs","volume":"50","author":"El-Zahar","year":"1984","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(02)00831-2_BIB4","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/s004930050034","article-title":"On the existence of disjoint cycles","volume":"18","author":"Enomoto","year":"1998","journal-title":"Combinatorica"},{"key":"10.1016\/S0012-365X(02)00831-2_BIB5","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF02024498","article-title":"On maximal paths and circuits of graphs","volume":"10","author":"Erd\u0151s","year":"1959","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"10.1016\/S0012-365X(02)00831-2_BIB6","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1002\/jgt.3190200209","article-title":"Covering a graph with cycles","volume":"20","author":"Wang","year":"1995","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(02)00831-2_BIB7","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/BF01787818","article-title":"Two vertex-disjoint cycles in a graph","volume":"11","author":"Wang","year":"1995","journal-title":"Graphs Combin."},{"key":"10.1016\/S0012-365X(02)00831-2_BIB8","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0012-365X(99)00009-6","article-title":"On the maximum number of independent cycles in a graph","volume":"205","author":"Wang","year":"1999","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(02)00831-2_BIB9","first-page":"179","article-title":"On the maximal number of vertices covered by disjoint cycles","volume":"21","author":"Wang","year":"2000","journal-title":"Austral. J. Combin."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X02008312?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X02008312?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T02:54:51Z","timestamp":1553914491000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X02008312"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":9,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["S0012365X02008312"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(02)00831-2","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}