【摘要】 设p≥1,pK2是p个K2的不相交的并,π=(d1,d2,…,dn)是一个可图序列且n≥2p.如果π有一个实现包含pK2作为子图(即π有一个实现包含一个p条边的匹配),则π称为是蕴含pK2-可图的.给出了蕴含pK2-可图序列π的一个刻划.更多还原

【Abstract】 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.更多还原