On the Maximum Diameter of $k$-Colorable Graphs
Work
Year: 2021
Type: article
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 ... more
Institutions University of South Carolina, University of Cincinnati
Cites: 3
Cited by: 4
Related to: 10
FWCI: 0.518
Citation percentile (by year/subfield): 67.45
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond