[1]
Lai, C. 2001. A Lower Bound for the Number of Edges in a Graph Containing No Two Cycles of the Same Length. The Electronic Journal of Combinatorics. 8, 1 (Oct. 2001), N9. DOI:https://doi.org/10.37236/1594.