A graph is called chordal if every cycle of it of length at least four has a chord. In the paper it is proved: Let G be a chordal graph with n vertices and m edges. Then G has a set of O(\(\sqrt{m})\) vertices whose removal leaves no connected component with more than n/2 vertices. Moreover, an O(m) time algorithm for finding the separating set is presented.