Improving a recent result of Fundikwa, Mazorodze, and Mukwembi, we show that d ≤ (2n−3)/5 for every connected C 4 -free graph of order n, diameter d, and edge-connectivity at least 3, which is best possible up to a small additive constant. For edge-connectivity at least 4, we improve this to d ≤ (n − 3)/3. Furthermore, adapting a construction due to Erdős, Pach, Pollack, and Tuza, for an odd prime power q at least 7, and every positive integer k, we show the existence of a connected C 4 -free graph of order n = (q 2 + q − 1)k + 1, diameter d = 4k, and edge-connectivity λ at least q − 6, in particular, d ≥ 4(n − 1)/(λ 2 + O(λ)).
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.