Finite solvable groups whose character graphs are trees

The aim of this paper is to classify all the finite solvable groups G whose character graphs Γ(G) have no triangles: they are exactly the finite groups with at most two non-linear irreducible characters, and the symmetric group S4.