The degree sequence of a finite graph is its list of vertex degrees in non-increasing order. The graph is called a realization of . In this paper, we characterize the graphic degree sequences such that no realization of contains an induced four-cycle. Our characterization is stated in terms of the class of forcibly chordal graphs.