{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T15:50:33Z","timestamp":1762271433580},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2010,5,19]],"date-time":"2010-05-19T00:00:00Z","timestamp":1274227200000},"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":[[2010,11]]},"DOI":"10.1007\/s00373-010-0948-3","type":"journal-article","created":{"date-parts":[[2010,5,18]],"date-time":"2010-05-18T04:58:14Z","timestamp":1274158694000},"page":"833-877","source":"Crossref","is-referenced-by-count":14,"title":["Proof of the Erd\u0151s\u2013Faudree Conjecture on Quadrilaterals"],"prefix":"10.1007","volume":"26","author":[{"given":"Hong","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,5,19]]},"reference":[{"key":"948_CR1","volume-title":"Extremal Graph Theory","author":"B. Bollob\u00e1s","year":"1978","unstructured":"Bollob\u00e1s B.: Extremal Graph Theory. Academic Press, London (1978)"},{"key":"948_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":"948_CR3","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0012-365X(84)90050-5","volume":"50","author":"M.H. El-Zahar","year":"1984","unstructured":"El-Zahar M.H.: On circuits in graphs. Discrete Math. 50, 227\u2013230 (1984)","journal-title":"Discrete Math."},{"key":"948_CR4","unstructured":"Erd\u0151s, P.: Some recent combinatorial problems, Technical Report, University of Bielefeld (1990)"},{"key":"948_CR5","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0012-365X(00)00279-X","volume":"235","author":"J. Koml\u00f3s","year":"2001","unstructured":"Koml\u00f3s J., S\u00e1rk\u00f6zy G.N., Szemer\u00e9di E.: Proof of the Alon-Yuster conjecture. Discrete Math. 235, 255\u2013269 (2001)","journal-title":"Discrete Math."},{"key":"948_CR6","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0012-365X(99)00053-9","volume":"203","author":"B. Randerath","year":"1999","unstructured":"Randerath B., Schiermeyer I., Wang H.: On quadrilaterals in a graph. Discrete Math. 203, 229\u2013237 (1999)","journal-title":"Discrete Math."},{"key":"948_CR7","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.disc.2004.02.020","volume":"288","author":"H. Wang","year":"2004","unstructured":"Wang H.: On quadrilaterals in a graph. Discrete Math. 288, 149\u2013166 (2004)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0948-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-010-0948-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0948-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:31Z","timestamp":1559055511000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-010-0948-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,19]]},"references-count":7,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2010,11]]}},"alternative-id":["948"],"URL":"https:\/\/doi.org\/10.1007\/s00373-010-0948-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,19]]}}}