On Potentially (K5-C4)-graphic Sequences
Abstract
In this paper, we characterize the potentially (K5-C4)-graphic sequences where K5-C4 is the graph obtained from K5 by removing four edges of a 4 cycle C4. This characterization implies a theorem due to Lai [6].
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.