Wang, Hong. 2018. “Covering a Graph With Cycles of Length at Least 4”. The Electronic Journal of Combinatorics 25 (1), P1.67. https://doi.org/10.37236/4099.