On Potentially (K₅-C₄)-graphic Sequences
classification
🧮 math.CO
keywords
graphicpotentiallysequencescharacterizationcharacterizecycleedgesfour
read the original 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].
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.