Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Hiebeler, Vanessa"'
Improving a recent result of Fundikwa, Mazorodze, and Mukwembi, we show that $d \leq (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
Externí odkaz:
http://arxiv.org/abs/2112.08805
Publikováno v:
In Discrete Mathematics May 2023 346(5)