Electronic Journal of Combinatorics, Volume 28, No. 3, Article P3.52, Year 2021
Notification
URL copied to clipboard!
We show that the diameter of (connected k-colorable graphs with minimum degree ≥ δ and order n is at most 3 − k−1)1n δ − 1, while for k = 3, it is at most 57n 23δ+O(1)..