On Potentially K5-E3-graphic Sequences
Abstract
Let Km-H be the graph obtained from Km by removing the edges set E(H) of H where H is a subgraph of Km. In this paper, we characterize the potentially K5-P3, K5-A3, K5-K3 and K5-K1,3-graphic sequences where A3 is P2 K2. Moreover, we also characterize the potentially K5-2K2-graphic sequences where pK2 is the matching consisted of p edges.
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.