Abstract
Fullerenes graphs are 3-connected, 3-regular planar graphs with faces including only pentagons and hexagons. If \(G\) be a graph with a perfect matching, a subgraph \(H\) of \(G\) is a nice subgraph if \(G − V(H)\) has a perfect matching. In this paper, we show that in every fullerene graph arising from smaller fullerenes via chamfer transformation, each pair of pentagons is a nice subgraph.
