蕴含(K_4-e)+C_4可图序列的刻画

On Potentially (K_4-e)+C_4-graphic Sequences

对于给定的图H,称π是蕴含H可图的,如果π有一个实现包含H作为子图.Kk,Ck,Pk分别表示k阶完全图,圈长为k的圈和路长为k的路.本文刻画了当n≥6时,蕴含(K4-e)+C4的可图序列.

For a graph H given, a graphic sequence π=（d1,d2,..., dn ） is said to be potentially H graphical if it has a realization containing H as a subgraph. Let Kk , Ck and Pk denote a complete graph on /~ vertices, a cycle on k vertices and a path on K＋1 vertices, respectively. In this paper the potentially （K4-e）＋C4-,graphic sequences is characterized.