Wei-Gen Yan

On Planar Extremal Nonsolid Bricks

A 3‐connected graph is called a brick when the deletion of any two distinct vertices leaves a graph with a perfect matching. Lovász (J. Combin. Theory (B) 43 (1987), 187–222.) proved that each brick contains at least perfect matchings. We call a brick extremal when its number of perfect matchings attains this l...