{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T01:20:02Z","timestamp":1773019202653,"version":"3.50.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,5,1]],"date-time":"1996-05-01T00:00:00Z","timestamp":830908800000},"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":6286,"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":[[1996,5]]},"DOI":"10.1016\/0012-365x(95)00242-o","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:55:55Z","timestamp":1027594555000},"page":"13-23","source":"Crossref","is-referenced-by-count":24,"title":["2-factors in dense graphs"],"prefix":"10.1016","volume":"152","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eldar","family":"Fischer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(95)00242-O_bib1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/rsa.3240030102","article-title":"The strong chromatic number of a graph","volume":"3","author":"Alon","year":"1992","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/0012-365X(95)00242-O_bib2","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF02350627","article-title":"Almost H-factors in dense graphs","volume":"8","author":"Alon","year":"1992","journal-title":"Graphs Combin."},{"key":"10.1016\/0012-365X(95)00242-O_bib3","doi-asserted-by":"crossref","unstructured":"N. Alon and R. Yuster, H-factors in dense graphs, J. Combin. Theory Ser. B, to appear.","DOI":"10.1006\/jctb.1996.0020"},{"key":"10.1016\/0012-365X(95)00242-O_bib4","series-title":"Extremal Graph Theory","author":"Bollob\u00e1s","year":"1978"},{"key":"10.1016\/0012-365X(95)00242-O_bib5","series-title":"Proc. Colloq. Internat. CNRS","article-title":"Problem","author":"Bollob\u00e1s","year":"1978"},{"key":"10.1016\/0012-365X(95)00242-O_bib6","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0095-8956(71)90016-5","article-title":"Pancyclic graphs I","volume":"11","author":"Bondy","year":"1971","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(95)00242-O_bib7","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0012-365X(79)90084-0","article-title":"The tail of the hypergeometric distribution","volume":"25","author":"Chv\u00e1tal","year":"1979","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(95)00242-O_bib8","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\/0012-365X(95)00242-O_bib9","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\/0012-365X(95)00242-O_bib10","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0095-8956(78)90005-9","article-title":"Edge disjoint placements of graphs","volume":"25","author":"Sauer","year":"1978","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(95)00242-O_bib11","series-title":"Proc. Colloq. Internat. CNRS","article-title":"Regular partitions of graphs","author":"Szemer\u00e9di","year":"1978"},{"key":"10.1016\/0012-365X(95)00242-O_bib12","unstructured":"Hong Wang, Three independent cycles of a graph, to appear."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500242O?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500242O?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T16:27:42Z","timestamp":1556382462000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9500242O"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,5]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,5]]}},"alternative-id":["0012365X9500242O"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(95)00242-o","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,5]]}}}