On potentially K₆-C₅ graphic sequences

2008/12/29 by Zhenghua Xu, Xu, Zhenghua, Chunhui Lai +1
Mathematics · #05C07 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05C07

paper · pdf · doi:10.48550/arxiv.0812.4861

20 pages

arxiv created 2009/07/08 · arxiv updated 2009/12/01

Abstract

For given a graph H, a graphic sequence π=(d₁,d₂,...,d_n) is said to be potentially H-graphic if there exists a realization of π containing H as a subgraph. In this paper, we characterize the potentially K₆-C₅ -graphic sequences.

Related

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