English

On Potentially K_5-E_3-graphic Sequences

Combinatorics 2007-09-17 v2

Abstract

Let KmHK_m-H be the graph obtained from KmK_m by removing the edges set E(H)E(H) of HH where HH is a subgraph of KmK_m. In this paper, we characterize the potentially K5P3K_5-P_3, K5A3K_5-A_3, K5K3K_5-K_3 and K5K1,3K_5-K_{1,3}-graphic sequences where A3A_3 is P2K2P_2\cup K_2. Moreover, we also characterize the potentially K52K2K_5-2K_2-graphic sequences where pK2pK_2 is the matching consisted of pp edges.

Keywords

Cite

@article{arxiv.math/0702245,
  title  = {On Potentially K_5-E_3-graphic Sequences},
  author = {Lili Hu and Chunhui Lai},
  journal= {arXiv preprint arXiv:math/0702245},
  year   = {2007}
}

Comments

25 pages