Geodesic
On potentially $K_5-H$-graphic sequences
Czechoslovak Mathematical Journal, Tome 59 (2009) no. 1, pp. 173-182 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

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.
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.
Classification : 05C07, 05C35
Keywords: graph; degree sequence; potentially $K_5-H$-graphic sequence 
@article{CMJ_2009_59_1_a11,
     author = {Hu, Lili and Lai, Chunhui and Wang, Ping},
     title = {On potentially $K_5-H$-graphic sequences},
     journal = {Czechoslovak Mathematical Journal},
     pages = {173--182},
     year = {2009},
     volume = {59},
     number = {1},
     mrnumber = {2486623},
     zbl = {1224.05104},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/CMJ_2009_59_1_a11/}
}
TY  - JOUR
AU  - Hu, Lili
AU  - Lai, Chunhui
AU  - Wang, Ping
TI  - On potentially $K_5-H$-graphic sequences
JO  - Czechoslovak Mathematical Journal
PY  - 2009
SP  - 173
EP  - 182
VL  - 59
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/CMJ_2009_59_1_a11/
LA  - en
ID  - CMJ_2009_59_1_a11
ER  - 
%0 Journal Article
%A Hu, Lili
%A Lai, Chunhui
%A Wang, Ping
%T On potentially $K_5-H$-graphic sequences
%J Czechoslovak Mathematical Journal
%D 2009
%P 173-182
%V 59
%N 1
%U http://geodesic.mathdoc.fr/item/CMJ_2009_59_1_a11/
%G en
%F CMJ_2009_59_1_a11
Hu, Lili; Lai, Chunhui; Wang, Ping. On potentially $K_5-H$-graphic sequences. Czechoslovak Mathematical Journal, Tome 59 (2009) no. 1, pp. 173-182. http://geodesic.mathdoc.fr/item/CMJ_2009_59_1_a11/