{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:22:02Z","timestamp":1761805322396},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2015,1,24]],"date-time":"2015-01-24T00:00:00Z","timestamp":1422057600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s00373-014-1504-3","type":"journal-article","created":{"date-parts":[[2015,1,23]],"date-time":"2015-01-23T13:27:57Z","timestamp":1422019677000},"page":"2437-2446","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Ramsey Numbers of $$C_4$$ C 4 versus Wheels and Stars"],"prefix":"10.1007","volume":"31","author":[{"given":"Yali","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongqi","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stanis\u0142aw P.","family":"Radziszowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,1,24]]},"reference":[{"key":"1504_CR1","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10623-010-9364-1","volume":"55","author":"M Abreu","year":"2010","unstructured":"Abreu, M., Balbuena, C., Labbate, D.: Adjacency matrices of polarity graphs and of other $$C_4$$ C 4 -free graphs of large size. Des. Codes Cryptogr. 55, 221\u2013233 (2010)","journal-title":"Des. Codes Cryptogr."},{"key":"1504_CR2","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/S0167-5060(08)70452-7","volume":"41","author":"SA Burr","year":"1989","unstructured":"Burr, S.A., Erd\u0151s, P., Faudree, R.J., Rousseau, C.C., Schelp, R.H.: Some complete bipartite graph-tree Ramsey numbers. Ann. Discret. Math. 41, 79\u201389 (1989)","journal-title":"Ann. Discret. Math."},{"key":"1504_CR3","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/jgt.3190130107","volume":"13","author":"CRJ Clapham","year":"1989","unstructured":"Clapham, C.R.J., Flockhart, A., Sheehan, J.: Graphs without four-cycles. J. Gr. Theory 13, 29\u201347 (1989)","journal-title":"J. Gr. Theory"},{"key":"1504_CR4","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1007\/s00373-013-1293-0","volume":"30","author":"J Dybizba\u0144ski","year":"2014","unstructured":"Dybizba\u0144ski, J., Dzido, T.: On some Ramsey numbers for quadrilaterals versus wheels. Gr. Combin. 30, 573\u2013579 (2014)","journal-title":"Gr. Combin."},{"key":"1504_CR5","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/j.jctb.2013.01.001","volume":"103","author":"FA Firke","year":"2013","unstructured":"Firke, F.A., Kosek, P.M., Nash, E.D., Williford, J.: Extremal graphs without 4-cycles. J. Combin. Theory Ser. B 103, 327\u2013336 (2013)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1504_CR6","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0095-8956(83)90018-7","volume":"34","author":"Z F\u00fcredi","year":"1983","unstructured":"F\u00fcredi, Z.: Graphs without quadrilaterals. J. Combin. Theory Ser. B 34, 187\u2013190 (1983)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1504_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jctb.1996.0052","volume":"68","author":"Z F\u00fcredi","year":"1996","unstructured":"F\u00fcredi, Z.: On the number of edges of quadrilateral-free graphs. J. Combin. Theory Ser. B 68, 1\u20136 (1996)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1504_CR8","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0304-3975(00)00233-4","volume":"263","author":"G K\u00e1rolyi","year":"2001","unstructured":"K\u00e1rolyi, G., Rosta, V.: Generalized and geometric Ramsey numbers for cycles. Theor. Comput. Sci. 263, 87\u201398 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"1504_CR9","doi-asserted-by":"crossref","first-page":"55","DOI":"10.2307\/2308928","volume":"67","author":"\u00d8 Ore","year":"1960","unstructured":"Ore, \u00d8.: Note on Hamilton circuits. Am. Math. Mon. 67, 55 (1960)","journal-title":"Am. Math. Mon."},{"key":"1504_CR10","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1090\/S0002-9947-1975-0396317-X","volume":"209","author":"TD Parsons","year":"1975","unstructured":"Parsons, T.D.: Ramsey graphs and block designs. I. Trans. Am. Math. Soc. 209, 33\u201344 (1975)","journal-title":"Trans. Am. Math. Soc."},{"key":"1504_CR11","unstructured":"Radziszowski, S.P.: Small Ramsey numbers, Electronic Journal of Combinatorics. pp 94 (#DS1). http:\/\/www.combinatorics.org (2014)"},{"key":"1504_CR12","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF02020254","volume":"9","author":"I Reiman","year":"1958","unstructured":"Reiman, I.: \u00dcber Ein Problem von K. Zarankiewicz. Acta Math. Hung. 9, 269\u2013273 (1958)","journal-title":"Acta Math. Hung."},{"key":"1504_CR13","first-page":"51","volume":"79","author":"Z Shao","year":"2009","unstructured":"Shao, Z., Xu, J., Xu, X.: A new Tur\u00e1n number for quadrilateral. Util. Math. 79, 51\u201358 (2009)","journal-title":"Util. Math."},{"key":"1504_CR14","first-page":"163","volume":"27","author":"KK Tse","year":"2003","unstructured":"Tse, K.K.: On the Ramsey number of the quadrilateral versus the book and the wheel. Australas J. Combin. 27, 163\u2013167 (2003)","journal-title":"Australas J. Combin."},{"key":"1504_CR15","first-page":"204","volume":"41","author":"Y Yang","year":"1992","unstructured":"Yang, Y., Rowlinson, P.: On extremal graphs without four-cycles. Util. Math. 41, 204\u2013210 (1992)","journal-title":"Util. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1504-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-014-1504-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1504-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:59:39Z","timestamp":1559041179000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-014-1504-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,24]]},"references-count":15,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["1504"],"URL":"https:\/\/doi.org\/10.1007\/s00373-014-1504-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,24]]}}}