1.
Dolati A, Golalizadeh S. The Tight Upper Bound for the Number of Matchings of Tricyclic Graphs. Electron. J. Combin. [Internet]. 2012Mar.31 [cited 2026Mar.14];19(1):P69. Available from: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v19i1p69