{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:14:56Z","timestamp":1758824096385},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1992,6,1]],"date-time":"1992-06-01T00:00:00Z","timestamp":707356800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[1992,6]]},"DOI":"10.1007\/bf02350627","type":"journal-article","created":{"date-parts":[[2006,3,16]],"date-time":"2006-03-16T00:30:24Z","timestamp":1142469024000},"page":"95-102","source":"Crossref","is-referenced-by-count":25,"title":["AlmostH-factors in dense graphs"],"prefix":"10.1007","volume":"8","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[]},{"given":"Raphael","family":"Yuster","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02350627_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J.A. Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications, London: Macmillan Press 1976"},{"key":"BF02350627_CR2","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/BF01895727","volume":"14","author":"K. Corr\u00e1di","year":"1963","unstructured":"Corr\u00e1di, K., Hajnal, A.: On the maximal number of independent circuits in a graph. Acta Math. Acad. Sci. Hungar.14 423\u2013439 (1963)","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"BF02350627_CR3","unstructured":"Erd\u00f6s, P.: Some recent combinatorial problems, November 1990 (preprint)"},{"key":"BF02350627_CR4","series-title":"Colloq. Math. Soc. J. Bolyai","first-page":"601","volume-title":"Combinatorial Theory and its Applications, Vol. II","author":"A. Hajnal","year":"1970","unstructured":"Hajnal, A., Szemer\u00e9di, E.: Proof of a conjecture of Erd\u00f6s. In: Combinatorial Theory and its Applications, Vol. II (P. Erd\u00f6s, A Renyi and V.T. S\u00f3s eds.), Colloq. Math. Soc. J. Bolyai 4, pp. 601\u2013623. Amsterdam: North Holland 1970"},{"key":"BF02350627_CR5","unstructured":"Szemer\u00e9di, E.: Regular partitions of graphs. In: Proc. Colloque Inter. CNRS (J.-C. Bermond, J.-C. Fournier, M. Las Vergnas and D. Sotteau eds.), pp. 399\u2013401, 1978"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02350627.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02350627\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02350627","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T10:20:38Z","timestamp":1558088438000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02350627"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["BF02350627"],"URL":"https:\/\/doi.org\/10.1007\/bf02350627","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}