engleski

Restricted 2-extendability of (3,6)-fullerenes

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 (3, 6)-fullerene graphs are not 2-extendable. In this contribution we examine 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.

Fullerene graph (3, 6)-fullerene Perfect matching 2-extendability Restricted 2- extendability

nije evidentirano