{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T06:51:47Z","timestamp":1772261507837,"version":"3.50.1"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,10,14]],"date-time":"2016-10-14T00:00:00Z","timestamp":1476403200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Period Math Hung"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s10998-016-0156-x","type":"journal-article","created":{"date-parts":[[2016,10,14]],"date-time":"2016-10-14T17:49:04Z","timestamp":1476467344000},"page":"73-78","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Cliques in $$C_4$$ C 4 -free graphs of large minimum degree"],"prefix":"10.1007","volume":"74","author":[{"given":"Andr\u00e1s","family":"Gy\u00e1rf\u00e1s","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e1bor N.","family":"S\u00e1rk\u00f6zy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,10,14]]},"reference":[{"key":"156_CR1","series-title":"Graphs and interconnection networks: diameter and vulnerability","first-page":"1","volume-title":"Surveys in Combinatorics, London Mathematical Society Lecture Notes Series","author":"JC Bermond","year":"1983","unstructured":"J.C. Bermond, J. Bond, M. Paoli, C. Peyrat, Surveys in Combinatorics, London Mathematical Society Lecture Notes Series, vol. 82, Graphs and interconnection networks: diameter and vulnerability (Cambridge University Press, Cambridge, 1983), pp. 1\u201329"},{"key":"156_CR2","unstructured":"J.C. Bermond, J. Bond, C. Peyrat, Bus interconnection networks with each station on two buses. Proc. Coll. Int. Alg. et Arch. Paralleles (Marseilles) 155\u2013167 (North Holland, 1986)"},{"key":"156_CR3","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0012-365X(90)90144-7","volume":"81","author":"FRK Chung","year":"1990","unstructured":"F.R.K. Chung, A. Gy\u00e1rf\u00e1s, W.T. Trotter, Zs Tuza, The maximum number of edges in $$2K_2$$ 2 K 2 -free graphs of bounded degree. Discret. Math. 81, 129\u2013135 (1990)","journal-title":"Discret. Math."},{"key":"156_CR4","first-page":"205","volume":"29 B","author":"RJ Faudree","year":"1990","unstructured":"R.J. Faudree, A. Gy\u00e1rf\u00e1s, R.H. Schelp, Zs Tuza, The strong chromatic index of graphs. Ars Comb. 29 B, 205\u2013211 (1990)","journal-title":"Ars Comb."},{"key":"156_CR5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/s004930200012","volume":"22","author":"A Gy\u00e1rf\u00e1s","year":"2002","unstructured":"A. Gy\u00e1rf\u00e1s, A. Hubenko, J. Solymosi, Large cliques in $$C_4$$ C 4 -free graphs. Combinatorica 22, 269\u2013274 (2002)","journal-title":"Combinatorica"},{"key":"156_CR6","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1006\/jctb.1997.1724","volume":"69","author":"M Molloy","year":"1997","unstructured":"M. Molloy, B. Reed, A bound on the strong chromatic index of a graphs. J. Comb. Theory Ser. B 69, 103\u2013109 (1997)","journal-title":"J. Comb. Theory Ser. B"},{"key":"156_CR7","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF02350634","volume":"8","author":"M Paoli","year":"1992","unstructured":"M. Paoli, G.W. Peck, W.T. Trotter, D.B. West, Large regular graphs with no induced $$2K_2$$ 2 K 2 . Graph Comb. 8, 165\u2013192 (1992)","journal-title":"Graph Comb."}],"container-title":["Periodica Mathematica Hungarica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10998-016-0156-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10998-016-0156-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10998-016-0156-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T01:11:01Z","timestamp":1498353061000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10998-016-0156-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,14]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["156"],"URL":"https:\/\/doi.org\/10.1007\/s10998-016-0156-x","relation":{},"ISSN":["0031-5303","1588-2829"],"issn-type":[{"value":"0031-5303","type":"print"},{"value":"1588-2829","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10,14]]}}}