  In this work we investigate the chordality of squares and line graph squares
of graphs. We prove a sufficient condition for the chordality of squares of
graphs not containing induced cycles of length at least five. Moreover, we
characterize the chordality of graph squares by forbidden subgraphs.
Transferring that result to line graphs allows us to characterize the
chordality of line graph squares.
