Characterizing Block Graphs in Terms of their Vertex-Induced Partitions

A. Dress, K. T. Huber, J. Koolen +2

Given a finite connected simple graph $G=(V,E)$ with vertex set $V$ and edge set $E\subseteq \left(\genfrac{}{}{0ex}{}{V}{2}\right)$, we will show that $1.$ the (necessarily unique) smallest block graph wit…