On k-resonant fullerene graphs

Dong Ye, Zhongbin Qi, Heping Zhang

A fullerene graph $F$ is a 3-connected plane cubic graph with exactly 12 pentagons and the remaining hexagons. Let $M$ be a perfect matching of $F$. A cycle $C$ of $F$ is $M$-alter…