{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:48:07Z","timestamp":1725558487289},"reference-count":5,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T00:00:00Z","timestamp":1160006400000},"content-version":"vor","delay-in-days":6427,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1989,3]]},"abstract":"Abstract<\/jats:title>We investigate the values of t<\/jats:italic>(n<\/jats:italic>), the maximum number of edges in a graph with n<\/jats:italic> vertices and not containing a four\u2010cycle. Techniques for finding these are developed and the values of t<\/jats:italic>(n<\/jats:italic>) for all n<\/jats:italic> up to 21 are obtained. All the corresponding extremal graphs are found.<\/jats:p>","DOI":"10.1002\/jgt.3190130107","type":"journal-article","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T12:19:55Z","timestamp":1180181995000},"page":"29-47","source":"Crossref","is-referenced-by-count":39,"title":["Graphs without four\u2010cycles"],"prefix":"10.1002","volume":"13","author":[{"given":"C. R. J.","family":"Clapham","sequence":"first","affiliation":[]},{"given":"A.","family":"Flockhart","sequence":"additional","affiliation":[]},{"given":"J.","family":"Sheehan","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,5]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"Graph Theory and Combinatorics","author":"Bialostocki A.","year":"1984"},{"key":"e_1_2_1_3_2","volume-title":"Extremal Graph Theory","author":"Bollob\u00e1s B.","year":"1978"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.4153\/CMB-1966-036-2"},{"key":"e_1_2_1_5_2","first-page":"215","article-title":"On a problem of graph theory","volume":"1","author":"Erd\u00f6s P.","year":"1966","journal-title":"Studia Sci. Math. Hungar."},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(83)90018-7"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190130107","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190130107","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T16:52:33Z","timestamp":1697907153000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190130107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,3]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,3]]}},"alternative-id":["10.1002\/jgt.3190130107"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190130107","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,3]]}}}