Algorithm over a p-regular bipartite graph

Question

I'm stuck with this exercise:

Let G = (V, E) be a p-regular bipartite graph Prove that a cycle can be found in O(|C|) time complexity using a dfs traversal;

Thanks in advance!.