Long cycles in critical graphs

It is shown that any k-critical graph with n vertices contains a cycle of length at least 2  p log (nÿ 1)/log(kÿ 2), improving a previous estimate of Kelly and Kelly obtained in 1954. ß 2000 John Wiley & Sons, Inc. J Graph Theory 35: 193±196, 2000