A nonroot vertex is an articulation point when one child subtree cannot climb above it. This is a compact note, but the quantifiers and hypotheses stay on the page.
Definitions first
Connectivity asks how many vertices or edges must be removed to disconnect a graph \(G\). Depth-first search timestamps \(\operatorname{tin}(v)\) and low-link values \(\operatorname{low}(v)\) expose local cut structure.
The formulas should not be merged too early. The datum \(\mathsf D\), the conclusion \(\mathsf C\), and the bridge \(\Longrightarrow\) have three different logical jobs.
A small case in full
The middle display is intentionally dense: it is where signs, bounds, multiplicities, or normalising factors are most likely to be lost.
The reusable statement
The aligned summary deliberately puts the datum and conclusion on different rows. Mathematically, this is the distinction between specifying an object and proving a property of it.
A nearby false statement
Bridge and articulation criteria depend on DFS-tree relationships. Applying them to an arbitrary spanning tree gives false positives.
The result is compact enough to reuse without pretending that the caveat has disappeared. The worked line remains the quickest consistency check.