On Potentially K₅-E₃-graphic Sequences

2007/02/09 by Lili Hu, Hu, Lili, Chunhui Lai +1
Mathematics · #05C07 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05C07

paper · pdf · doi:10.48550/arxiv.math/0702245

25 pages

arxiv created 2007/09/17 · arxiv updated 2009/12/01

Abstract

Let K_m-H be the graph obtained from K_m by removing the edges set E(H) of H where H is a subgraph of K_m. In this paper, we characterize the potentially K₅-P₃, K₅-A₃, K₅-K₃ and K₅-K_1,3-graphic sequences where A₃ is P₂∪ K₂. Moreover, we also characterize the potentially K₅-2K₂-graphic sequences where pK₂ is the matching consisted of p edges.

Related

• A Characterization On Potentially K_2,5-graphic Sequences
• A Characterization On Potentially K₆-C₄-graphic Sequences
• On Potentially (K₅-C₄)-graphic Sequences
• On potentially K₆-C₅ graphic sequences
• An extremal problem on potentially K_m-P_k-graphic sequences