A graph G is a brick if it is 3-connected and G-\u, v\ has a perfect matching for any two distinct vertices u and v of G. Lucchesi and Murty proposed a problem concerning the characterization of bricks, distinct from K₄, C₆ and the Petersen graph, in which every b-invariant edge is solitary. In this paper, we present a characterization of this problem when the bricks are claw-free.
Zhang et al. (Sat,) studied this question.