◀ ▲ ▶Branches / Graph-theory / Proposition: Characterization of Cutvertices
Proposition: Characterization of Cutvertices
A vertex of a connected graph \(G(V,E,\gamma)\) is a cutvertex if and only if there exist two other vertices \(x,y\in V\) such that every path between \(x\) and \(y\), i.e. a path
with \(x_0=x\), \(x_k=y\) passes through \(v\), i.e. \(x_i=v\) for some \(1\le i\le k-1\).
Table of Contents
- Diestel, Reinhard: "Graph Theory, 3rd Edition", Springer, 2005