On Potentially $(K_5-C_4)$-graphic Sequences
Year: 2006
Type: article
Abstract: In 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].
Source: Utilitas Mathematica
Authors: Hu, Lili, Lai, Chunhui
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W1507535457