For given a graphH , a graphic sequence π = (d1, d2, · · · , dn) 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 Hgraphic sequences where H denotes 3-regular graph with 6 vertices. In other words, we characterize the potentially K3,3 and K6 − C6graphic sequences where Kr,r is an r × r complete bipa...

Let Km −H be the graph obtained from Km by removing the edges set E(H) of H where H is a subgraph of Km. In this paper, we characterize the potentially K5 − P3, K5 − A3, K5 −K3 and K5 − K1,3-graphic sequences where A3 is P2 ∪ K2. Moreover, we also characterize the potentially K5 − 2K2-graphic sequences where pK2 is the matching consisted of p edges.

For given a graphH , a graphic sequence π = (d1, d2, · · · , dn) is said to be potentially H-graphic if there exists a realization of π containing H as a subgraph. Let Km −H be the graph obtained from Km by removing the edges set E(H) where H is a subgraph of Km. In this paper, we characterize the potentially K2,5-graphic sequences. This characterization implies a theorem due to Yin et al. [15].

For given a graphH , a graphic sequence π = (d1, d2, · · · , dn) is said to be potentially H-graphic if there exists a realization of π containing H as a subgraph. Let Km −H be the graph obtained from Km by removing the edges set E(H) where H is a subgraph of Km. In this paper, we characterize the potentially K6 − C4-graphic sequences. This characterization implies a theorem due to Hu and Lai [7].

For given a graphH , a graphic sequence π = (d1, d2, · · · , dn) is said to be potentially H-graphic if there exists a realization of π containing H as a subgraph. Let Km − H be the graph obtained from Km by removing the edges set E(H) where H is a subgraph of Km. In this paper, we characterize potentially K2,5-graphic sequences. This characterization implies a special case of a theorem due to ...