On potentially K 5-H-graphic sequences
Lili Hu, Chunhui Lai, Ping Wang · Czechoslovak Mathematical Journal · 2009
Let K m -H be the graph obtained from K m by removing the edges set E(H) of H where H is a subgraph of K m . In this paper, we characterize the potentially K 5-P 4 and K 5-Y 4-graphic sequences where Y 4 is a tree on 5 vertices and 3 leaves.