1.
Lai C. A Lower Bound for the Number of Edges in a Graph Containing No Two Cycles of the Same Length. Electron. J. Combin. [Internet]. 2001Oct.20 [cited 2026Mar.27];8(1):N9. Available from: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v8i1n9