1 paper
Fuliang Lu, Huali Pan
A 3-connected graph is a brick if the graph obtained from it by deleting any two distinct vertices has a perfect matching. The importance of bricks stems from the fact that they ar…