Does a chordal graph where the size of minimal separators is constrained have name?
In this paper graphs in which the size of every minimal separator $|S| \le k$ are called graphs of separability at most $k$.

Theorem 1 of that paper implies that chordal graphs of separability at most $2$ are obtained from complete graphs by "gluing" along a vertex or an edge.