Potentially pK_2-graphic Sequences
Jian-Hua Yin · Journal of Natural Science of Heilongjiang University · 2009
Let p≥1,pK2 be the disjoint union of p copies of K2 and π=(d1,d2,…,dn) be a graphic sequence with n≥2p.If π has a realization containing pK2 as a subgraph(i.e.π has a realization containing a matching of p edges),then π is said to be potentially pK2-graphic.A characterization for π to be potentially pK2-graphic is given.