It is shown that any k-critical graph with n vertices contains a cycle of length at least 2√log(n-1)/log(k-2), improving a previous estimate of Kelly and Kelly obtained in 1954.
|Number of pages||4|
|Journal||Journal of Graph Theory|
|State||Published - Nov 2000|
- Critical graph