From Rosen's Discrete Mathematics and Its Applications, 3ed, chapter 10 p. 683:
From what I see, the removal of b and its incident edges produces one subgraph and a lone vertex. In contrast, the removal of c and e produces two subgraphs each. How can b qualify as a cut vertex?