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
相关论文
共 50 条
  • [1] On potentially K 5-H-graphic sequences
    Hu, Lili
    Lai, Chunhui
    Wang, Ping
    CZECHOSLOVAK MATHEMATICAL JOURNAL, 2009, 59 (01) : 173 - 182
  • [2] On Potentially K6-C5 graphic Sequences
    Xu, Zhenghua
    Lai, Chunhui
    UTILITAS MATHEMATICA, 2011, 86 : 3 - 22
  • [3] On Potentially K5-E3-graphic Sequences
    Hu, Lili
    Lai, Chunhui
    ARS COMBINATORIA, 2011, 101 : 359 - 383
  • [4] On potentially H-graphic sequences
    Meng-Xiao Yin
    Jian-Hua Yin
    Czechoslovak Mathematical Journal, 2007, 57 : 705 - 724
  • [5] Potentially H-graphic sequences
    Yin, Meng-Xiao
    Yin, Jian-Hua
    CZECHOSLOVAK MATHEMATICAL JOURNAL, 2007, 57 (02) : 705 - 724
  • [6] On Potentially (K5 - C4)-graphic Sequences
    Hu, Lili
    Lai, Chunhui
    ARS COMBINATORIA, 2011, 99 : 175 - 192
  • [7] On potentially K6-3K2-graphic sequences
    Chen, Gang
    ARS COMBINATORIA, 2014, 116 : 3 - 21
  • [8] A Characterization On Potentially K2,5-graphic Sequences
    Hu, Lili
    Lai, Chunhui
    ARS COMBINATORIA, 2014, 116 : 417 - 431
  • [9] A GENERAL LOWER BOUND FOR POTENTIALLY H-GRAPHIC SEQUENCES
    Ferrara, Michael J.
    Schmitt, John
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2009, 23 (01) : 517 - 526
  • [10] On the approximate shape of degree sequences that are not potentially H-graphic
    Erbes, Catherine
    Ferrara, Michael
    Martin, Ryan R.
    Wenger, Paul S.
    JOURNAL OF COMBINATORICS, 2019, 10 (02) : 339 - 363
12345