Distance-restricted matching extendability of fullerene graphs.

A fullerene graph is a 3-connected cubic plane graph whose all faces are bounded by 5- or 6-cycles. In this paper, we show that a matching M of a fullerene graph can be extended to a perfect matching if the following hold: (i) three faces around each vertex in $$\{x,y:xy\in M\}$$ are bounded by 6-cycles and (ii) the edges in M lie at distance at least 13 pairwise. [ABSTRACT FROM AUTHOR]