On potentially K5-H-graphic sequences

被引：0
作者：
Lili Hu
Chunhui Lai
Ping Wang
机构：
[1] Zhangzhou Teachers College,Department of Mathematics
[2] St. Francis Xavier University,Dept. of Math., Stats. and Computer Science
来源：
Czechoslovak Mathematical Journal | 2009年 / 59卷
关键词：
graph; degree sequence; potentially ; -; -graphic sequence; 05C07; 05C35;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Let Km-H be the graph obtained from Km by removing the edges set E(H) of H where H is a subgraph of Km. In this paper, we characterize the potentially K5-P4 and K5-Y4-graphic sequences where Y4 is a tree on 5 vertices and 3 leaves.
引用
收藏
页码：173 / 182
页数：9
相关论文
共 28 条
  • [1] Gupta G.(2007)Graphic sequences of trees and a problem of Frobenius Czech. Math. J. 57 49-52
  • [2] Joshi P.(1973)Algorithm for constructing graphs and digraphs with given valences and factors Discrete Math. 6 79-88
  • [3] Tripathi A.(2001)A note on potentially Australas J. Comb. 24 123-127
  • [4] Kleitman D. J.(2007)- J. Comb. Math. Comb. Comput. 61 59-63
  • [5] Wang D. L.(2005) graphical sequences Discret. Math. Theor. Comput. Sci. 7 75-80
  • [6] Lai C.(1998)An extremal problem on potentially J. Graph Theory 29 63-72
  • [7] Lai C.(1998)- Sci. China (Ser. A) 41 510-520
  • [8] Lai C.(2001)-graphic sequences Southeast Asian Bull. Math. 25 427-434
  • [9] Li J.-S.(2002)An extremal problem on potentially Ars Comb. 64 301-318
  • [10] Song Z.-X.(2005)-graphic sequences Ars Combin. 75 233-239
123