Extremal fullerene graphs with the maximum Clar number

Dong Ye, Heping Zhang

A fullerene graph is a cubic 3-connected plane graph with (exactly 12) pentagonal faces and hexagonal faces. Let $F_n$ be a fullerene graph with $n$ vertices. A set $\mathcal{H}$ of…