
Plummer, Michael D.
Exponentially many perfect matchings in cubic graphs ★★★
Conjecture There exists a fixed constant
so that every
-vertex cubic graph without a cut-edge has at least
perfect matchings.



Keywords: cubic; perfect matching

Keywords: cubic; perfect matching