On Potentially \((K_5 – C_4)\)-graphic Sequences

Abstract

In this paper, we characterize the potentially \((K_5 – C_4)\)-graphic sequences, where \(K_s – C_4\) is the graph obtained from \(K_5\) by removing four edges of a \(4\)-cycle \(C_4\). This characterization implies a theorem due to Lai \([6]\).