The root vertex must be handled separately: it is a cut vertex if and only if it has at least two children.
A simple alternative to the above algorithm uses chain decompositions, which are special ear decompositions depending on DFS-trees [REF].