A Characterization On Potentially K₂,₅-graphic Sequences

Original · EN

For given a graph H, a graphic sequence π=(d₁,d₂,...,dₙ) is said to be potentially H-graphic if there exists a realization of π containing H as a subgraph. Let Kₘ-H be the graph obtained from Kₘ by removing the edges set E(H) where H is a subgraph of Kₘ. In this paper, we characterize potentially K₂,₅-graphic sequences. This characterization implies a special case of a theorem due to Yin et al. [26].