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

Lili Hu; Chunhui Lai; Ping Wang

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

Combinatorics 2009-11-15 v1

Authors: Lili Hu , Chunhui Lai , Ping Wang

Abstract

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.

Cite

@article{arxiv.math/0702166,
  title  = {On Potentially $(K_5-H)$-graphic Sequences},
  author = {Lili Hu and Chunhui Lai and Ping Wang},
  journal= {arXiv preprint arXiv:math/0702166},
  year   = {2009}
}

Comments

9 pages

Related papers

View all related →