Restricted 2-extendability of (3,6)-fullerenes
A (3,6)-fullerene is an infinite family of cubic planar graphs with only hexagonal and triangular faces. A graph \(G\) with a perfect matching is \(k\)-extendable if it has a matching of size \(k\) and if every such matching can be extended to a perfect matching in \(G\). It is well known that no (3,6)-fullerene graph is 2-extendable. In this paper, the author examines what can be salvaged and under what conditions can a matching of size two be extended to a perfect matching in a (3,6)-fullerene graph.
scientific article; zbMATH DE number 7352768