2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/120953In this paper, we characterize the potentially $(K_5-C_4)$-graphic sequences where $K_5-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].18 pagesCombinatorics05C07On Potentially $(K_5-C_4)$-graphic Sequencestext