Show that every graph with χ(G) = k, contains a cycle of length at least k

Question

I know that any k-chromatic graph has at least k vertices of degree at least k−1 each. But how does this gurantees a cycle of length at least k.