Importance and Redundancy in Fullerene Graphs

Sa？etak The concept of importance of an edge in a fullerene graph has been defined and lower bounds have been established for this quantity. These lower bounds are then used to obtain an improved lower bound on the number of perfect matchings in fullerene graphs