{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T15:49:14Z","timestamp":1649000954542},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,11,3]],"date-time":"2015-11-03T00:00:00Z","timestamp":1446508800000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s10878-015-9972-9","type":"journal-article","created":{"date-parts":[[2015,11,3]],"date-time":"2015-11-03T01:13:43Z","timestamp":1446513223000},"page":"422-444","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Maximum cardinality neighbourly sets in quadrilateral free graphs"],"prefix":"10.1007","volume":"33","author":[{"given":"K. S.","family":"Neethi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjeev","family":"Saxena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,3]]},"reference":[{"key":"9972_CR1","volume-title":"The design and analysis of computer algorithms","author":"AV Aho","year":"1974","unstructured":"Aho AV, Hopcroft JE, Ullman JD (1974) The design and analysis of computer algorithms. Addison-Wesley Publishing Company, Boston"},{"key":"9972_CR2","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF02523189","volume":"17","author":"N Alon","year":"1997","unstructured":"Alon N, Yuster R, Zwick U (1997) Finding and counting given length cycles. Algorithmica 17:209\u2013223","journal-title":"Algorithmica"},{"key":"9972_CR3","doi-asserted-by":"crossref","unstructured":"Barrett CL, Kumar VSA, Marathe MV, Thite S, Istrate G (2006) Strong edge coloring for channel assignment in wireless radio networks. In: Proceedings of the 4th annual IEEE international conference on pervasive computing and communications workshops, PERCOMW \u201906, pp 106\u2013110","DOI":"10.1109\/PERCOMW.2006.129"},{"key":"9972_CR4","unstructured":"Bezem GJ, van Leeuwen J (1987) Enumeration in graphs. Technical Report RUU-CS-87-07, Department of Information and Computing Sciences, Utrecht University"},{"key":"9972_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0619-4","volume-title":"Modern graph theory","author":"B Bollobas","year":"1998","unstructured":"Bollobas B (1998) Modern graph theory. Springer, New York"},{"issue":"3","key":"9972_CR6","doi-asserted-by":"crossref","first-page":"281","DOI":"10.4153\/CMB-1966-036-2","volume":"9","author":"WG Brown","year":"1966","unstructured":"Brown WG (1966) On graphs that do not contain a Thomsen graph. Can Math Bull 9(3):281\u2013285","journal-title":"Can Math Bull"},{"issue":"1\u20133","key":"9972_CR7","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0166-218X(92)90275-F","volume":"24","author":"K Cameron","year":"1989","unstructured":"Cameron K (1989) Induced matchings. Discret Appl Math 24(1\u20133):97\u2013102","journal-title":"Discret Appl Math"},{"issue":"1","key":"9972_CR8","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/0214017","volume":"14","author":"N Chiba","year":"1985","unstructured":"Chiba N, Nishizeki T (1985) Arboricity and subgraph listing algorithms. SIAM J Comput 14(1):210\u2013223","journal-title":"SIAM J Comput"},{"issue":"1","key":"9972_CR9","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/jgt.3190130107","volume":"13","author":"CRJ Clapham","year":"1989","unstructured":"Clapham CRJ, Flockhart A, Sheehan J (1989) Graphs without four-cycles. J Graph Theory 13(1):29\u201347","journal-title":"J Graph Theory"},{"key":"9972_CR10","unstructured":"Conlon D, Fox J, Sudakov B (2014) Large subgraphs without complete bipartite graphs. arXiv:1401.6711v1"},{"key":"9972_CR11","first-page":"74","volume":"2","author":"P Erdos","year":"1938","unstructured":"Erdos P (1938) On sequences of integers no one of which divides the product of two others and on some related problems. Tomsk Gos Univ Ucen Zap 2:74\u201382","journal-title":"Tomsk Gos Univ Ucen Zap"},{"key":"9972_CR12","first-page":"215","volume":"1","author":"P Erdos","year":"1966","unstructured":"Erdos P, Renyi A, Sos VT (1966) On a problem of graph theory. Stud Sci Math Hung 1:215\u2013235","journal-title":"Stud Sci Math Hung"},{"key":"9972_CR13","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/j.jctb.2013.01.001","volume":"103","author":"FA Firke","year":"2013","unstructured":"Firke FA, Kosek PM, Nash ED, Williford J (2013) Extremal graphs without 4-cycles. J Comb Theory Ser B 103:327\u2013336","journal-title":"J Comb Theory Ser B"},{"key":"9972_CR14","unstructured":"Fiorini G, Lazebnik F (1994) On a bound for the maximum number of $$C_8$$ C 8 \u2019s in a 4-cycle free bipartite graph, Congressus Numerantium, vol 99, pp 191\u2013197. http:\/\/www.math.udel.edu\/~lazebnik\/papers\/GFC8"},{"key":"9972_CR15","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1023\/A:1005987814905","volume":"52","author":"G Fiorini","year":"1998","unstructured":"Fiorini G, Lazebnik F (1998) An extremal characterization of the incidence graphs of projective planes. Acta Appl Math 52:257\u2013260","journal-title":"Acta Appl Math"},{"key":"9972_CR16","unstructured":"Fiorini G, Lazebnik F (2015) On the maximum number of C6\u2019s in a quadrilateral-free bipartite graph. http:\/\/www.math.udel.edu\/~lazebnik\/papers\/GFC6OLD"},{"issue":"1","key":"9972_CR17","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1137\/140954416","volume":"29","author":"F Foucaud","year":"2015","unstructured":"Foucaud F, Krivelevich M, Perarnau G (2015) Large subgraphs without short cycles. SIAM J Discret Math 29(1):65\u201378","journal-title":"SIAM J Discret Math"},{"key":"9972_CR18","doi-asserted-by":"crossref","unstructured":"Furedi Z, Simonovits M (2013) The history of degenerate (bipartite) extremal graph problems. arXiv:1306.5167v2","DOI":"10.1007\/978-3-642-39286-3_7"},{"issue":"2","key":"9972_CR19","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0095-8956(83)90018-7","volume":"34","author":"Z Furedi","year":"1983","unstructured":"Furedi Z (1983) Graphs without quadrilaterals. J Comb Theory Ser B 34(2):187\u2013190","journal-title":"J Comb Theory Ser B"},{"key":"9972_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jctb.1996.0052","volume":"68","author":"Z Furedi","year":"1996","unstructured":"Furedi Z (1996) On the number of edges of quadrilateral-free graphs. J Comb Theory Ser B 68:1\u20136","journal-title":"J Comb Theory Ser B"},{"issue":"4","key":"9972_CR21","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1137\/0207033","volume":"7","author":"A Itai","year":"1978","unstructured":"Itai A, Rodeh M (1978) Finding a minimum circuit in a graph. SIAM J Comput 7(4):413\u2013423","journal-title":"SIAM J Comput"},{"issue":"2","key":"9972_CR22","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s00493-007-0050-5","volume":"27","author":"S Isobe","year":"2007","unstructured":"Isobe S, Zhou X, Nishizeki T (2007) Total colorings of degenerate graphs. Combinatorica 27(2):167\u2013182","journal-title":"Combinatorica"},{"key":"9972_CR23","volume-title":"Graph coloring problems","author":"TR Jensen","year":"1995","unstructured":"Jensen TR, Tof B (1995) Graph coloring problems. Wiley, New York"},{"key":"9972_CR24","volume-title":"Extremal combinatorics\u2014with applications in computer science. Texts in theoretical computer science","author":"S Jukna","year":"2001","unstructured":"Jukna S (2001) Extremal combinatorics\u2014with applications in computer science. Texts in theoretical computer science. Springer, New York"},{"key":"9972_CR25","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/S0166-218X(01)00237-2","volume":"118","author":"M Mahdian","year":"2002","unstructured":"Mahdian M (2002) On the computational complexity of strong edge coloring. Discret Appl Math 118:239\u2013248","journal-title":"Discret Appl Math"},{"key":"9972_CR26","doi-asserted-by":"crossref","first-page":"2898","DOI":"10.1016\/j.laa.2009.01.002","volume":"430","author":"V Nikiforov","year":"2009","unstructured":"Nikiforov V (2009) The maximum spectral radius of C4 -free graphs of given order and size. Linear Algebra Appl 430:2898\u20132905","journal-title":"Linear Algebra Appl"},{"key":"9972_CR27","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF02020254","volume":"9","author":"I Reiman","year":"1959","unstructured":"Reiman I (1959) Uber ein Problem von K. Zarankiewicz. Acta Math Acad Sci Hung 9:269\u2013279","journal-title":"Acta Math Acad Sci Hung"},{"key":"9972_CR28","doi-asserted-by":"crossref","unstructured":"Sen A, Huson M (1996) A new model for scheduling packet radio networks. In: Proceedings of IEEE INFOCOM\u201996, vol 3, pp 1116\u20131124","DOI":"10.1109\/INFCOM.1996.493055"},{"key":"9972_CR29","unstructured":"Timmons C (2014) Lower bounds on the 4-cycle Turan number, Manuscript, December 5. http:\/\/webpages.csus.edu\/~craig.timmons\/papers\/c4turanlb"},{"key":"9972_CR30","doi-asserted-by":"crossref","first-page":"1641","DOI":"10.1016\/j.laa.2012.05.006","volume":"437","author":"M Zhai","year":"2012","unstructured":"Zhai M, Wang B (2012) Proof of a conjecture on the spectral radius of C4 -free graphs. Linear Algebra Appl 437:1641\u20131647","journal-title":"Linear Algebra Appl"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9972-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9972-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9972-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9972-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T02:19:57Z","timestamp":1567304397000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9972-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,3]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["9972"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9972-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,3]]}}}