English

On Potentially $(K_5-C_4)$-graphic Sequences

Combinatorics 2007-05-23 v1

Abstract

In this paper, we characterize the potentially (K5C4)(K_5-C_4)-graphic sequences where K5C4K_5-C_4 is the graph obtained from K5K_5 by removing four edges of a 4 cycle C4C_4. This characterization implies a theorem due to Lai [6].

Keywords

Cite

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

Comments

18 pages