Wang, Hong. “Covering a Graph With Cycles of Length at Least 4”. The Electronic Journal of Combinatorics 25, no. 1 (March 16, 2018): #P1.67. Accessed May 15, 2026. https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i1p67.