Given a connected graph $G = (V,E)$, we say that a vertex $v \in V$ is a cut vertex of $G$ if the removal of $v$ from $G$ causes $G$ to become disconnected.
How can I find all cut vertices of a given graph using Mathematica? Apparently there was an
ArticulationVertices function in Combinatorica, which the docs say has been superseded by
FindVertexCut. However, this new function only finds one cut vertex (if one exists), where the old one found all of them.
I should note that I'm working with some code that uses native
Graph objects, and would prefer not to have to deal with
Combinatorica`Graphs if possible.
FindVertexCutreturns a list of vertices representing smallest cut, and you want to find all smallest or all possible? $\endgroup$