Author:
Czabarka Éva,Singgih Inne,Székely László A.
Abstract
We show that the diameter of connected $k$-colorable graphs with minimum degree $\geq \delta$ and order $n$ is at most $\left(3-\frac{1}{k-1}\right)\frac{n}{\delta}-1$, while for $k=3$, it is at most $\frac{57n}{23\delta}+O\left(1\right)$.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献