THE SQUARE OF A CONNECTED S(K1,3)-FREE GRAPH IS VERTEX PANCYCLIC

被引：16
|
作者：
HENDRY, G [1 ]
VOGLER, W [1 ]
机构：
[1] UNIV HAMBURG,D-2000 HAMBURG 13,FED REP GER
来源：
JOURNAL OF GRAPH THEORY | 1985年 / 9卷 / 04期
关键词：
D O I：
10.1002/jgt.3190090415
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：535 / 537
页数：3
相关论文
共 50 条
  • [31] On K1,3-free strictly Deza graphs
    A. V. Mityanina
    [J]. Proceedings of the Steklov Institute of Mathematics, 2017, 297 : 159 - 162
  • [32] The Maximum Genus on a 3-Vertex-Connected Graph
    Yuangqiu Huang
    [J]. Graphs and Combinatorics, 2000, 16 : 159 - 164
  • [33] The maximum genus on a 3-vertex-connected graph
    Huang, YQ
    [J]. GRAPHS AND COMBINATORICS, 2000, 16 (02) : 159 - 164
  • [34] {K1,3, Z2}-free graphs of low connectivity
    Fuller, AG
    [J]. ARS COMBINATORIA, 2001, 59 : 97 - 106
  • [35] K1,3-free图中的圈
    施容华
    [J]. 科学通报, 1987, (03) : 233 - 233
  • [36] REGULAR FACTORS IN K1,3-FREE GRAPHS
    CHOUDUM, SA
    PAULRAJ, MS
    [J]. JOURNAL OF GRAPH THEORY, 1991, 15 (03) : 259 - 265
  • [37] Vertex-disjoint copies of K1,t in K1,r-free graphs
    Jiang, Suyun
    Chiba, Shuya
    Fujita, Shinya
    Yan, Jin
    [J]. DISCRETE MATHEMATICS, 2017, 340 (04) : 649 - 654
  • [38] Cyclability in k-connected K1,4-free graphs
    Flandrin, Evelyne
    Gyori, Ervin
    Li, Hao
    Shu, Jinlong
    [J]. DISCRETE MATHEMATICS, 2010, 310 (20) : 2735 - 2741
  • [39] On K1,3-Free Strictly Deza Graphs
    Mityanina, A. V.
    [J]. PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS, 2017, 297 : S159 - S162
  • [40] Connected even factors in {K1,l, K1,l + e}-free graphs
    Duan, Fang
    Zhang, Weijuan
    Wang, Guoping
    [J]. ARS COMBINATORIA, 2014, 115 : 385 - 389
12345