{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T06:37:05Z","timestamp":1768718225059,"version":"3.49.0"},"reference-count":7,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,7,1]],"date-time":"1999-07-01T00:00:00Z","timestamp":930787200000},"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":5130,"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":[[1999,7]]},"DOI":"10.1016\/s0012-365x(99)00009-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:55:32Z","timestamp":1027608932000},"page":"183-190","source":"Crossref","is-referenced-by-count":51,"title":["On the maximum number of independent cycles in a graph"],"prefix":"10.1016","volume":"205","author":[{"given":"Hong","family":"Wang","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(99)00009-6_BIB1","doi-asserted-by":"crossref","unstructured":"B. Bollob\u00e1s, Extremal Graph Theory, Academic Press, London, 1978.","DOI":"10.1007\/978-1-4612-9967-7"},{"key":"10.1016\/S0012-365X(99)00009-6_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. Hung."},{"key":"10.1016\/S0012-365X(99)00009-6_BIB3","unstructured":"G. Dirac, Structural properties and circuits in graphs, Proceedings of the fifth British Combinatorial Conference, 1975, pp. 135\u2013140."},{"key":"10.1016\/S0012-365X(99)00009-6_BIB4","unstructured":"A. Hajnal, E. Szemer\u00e9di, Proof of a conjecture of Erd\u0151s, in: P. Erd\u0151s, A. Renyi, V. S\u00f3s (Eds.), Combinatorial Theory and its Application, vol. II, Colloq. Math. Soc. J. Bolyai, vol. 4, North-Holland, Amsterdam, 1970, pp. 601\u2013623."},{"key":"10.1016\/S0012-365X(99)00009-6_BIB5","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0167-5060(08)70467-9","article-title":"On independent circuits in finite graphs and a conjecture of Erd\u0151s and P\u00f3sa","volume":"41","author":"Justesen","year":"1989","journal-title":"Ann. Disc. Math."},{"key":"10.1016\/S0012-365X(99)00009-6_BIB6","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF02986677","article-title":"Independent cycles with limited size in a graph","volume":"10","author":"Wang","year":"1994","journal-title":"Graphs and Combin."},{"key":"10.1016\/S0012-365X(99)00009-6_BIB7","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1006\/jctb.1996.0037","article-title":"On the maximum number of independent cycles in a bipartite graph","volume":"67","author":"Wang","year":"1996","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X99000096?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X99000096?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T22:07:38Z","timestamp":1578607658000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X99000096"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,7]]},"references-count":7,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,7]]}},"alternative-id":["S0012365X99000096"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(99)00009-6","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,7]]}}}