A good characterization of squares of strongly chordal split graphs

► We give a structural characterization of squares of strongly chordal split graphs. ► This implies a quadratic-time recognition algorithm for these graphs. ► Our results are of interest because recognizing squares of split graphs is hard. ► The complexity status of recognizing squares of strongly chordal graphs is unknown.