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_4$, $\overline{C_6}$ 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.