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 条

[1] Induced S(K1,3) and hamiltonian cycles in the square of a graph
Abderrezzak, ME
Flandrin, E
Ryjácek, Z
[J]. DISCRETE MATHEMATICS, 1999, 207 (1-3) : 263 - 269
[2] Vertex -disjoint copies of K1,3 in K1,r-free graphs
Jiang, Suyun
Yan, Jin
[J]. DISCRETE MATHEMATICS, 2016, 339 (12) : 3085 - 3088
[3] Every 3-connected {K1,3, N1,2,3}-free graph is Hamilton-connected
Hu, Zhiquan
Zhang, Shunzhe
[J]. GRAPHS AND COMBINATORICS, 2016, 32 (02) : 685 - 705
[4] Every 3-connected {K1,3,N3,3,3}-free graph is Hamiltonian
HouYuan Lin
ZhiQuan Hu
[J]. Science China Mathematics, 2013, 56 : 1585 - 1595
[5] Every 3-connected {K1,3,N3,3,3}-free graph is Hamiltonian
LIN HouYuan
HU ZhiQuan
[J]. Science China Mathematics, 2013, 56 (08) : 1588 - 1598
[6] ON CONNECTED FACTORS IN K1,3-FREE GRAPHS
李国君
刘振宏
[J]. Acta Mathematicae Applicatae Sinica, 1998, (01) : 43 - 47
[7] Every 3-connected {K1,3, Z7}-free graph of order at least 21 is Hamilton-connected
Ryjacek, Zdenek
Vrana, Petr
[J]. DISCRETE MATHEMATICS, 2021, 344 (06)
[8] Longest Cycles in 3-Connected, K1,3-Free Graphs
李明楚
[J]. 数学进展, 1989, (01) : 119 - 119
[9] HAMILTONICITY IN 2-CONNECTED {K1,3 F}-FREE GRAPHS
LI Guojun(Mathematics Depertment of Yantai Teacher’s College
[J]. Journal of Systems Science & Complexity, 1996, (04) : 295 - 305
[10] LONGEST CYCLES IN κ-CONNECTED K1,3-FREE GRAPHS
吴正声
[J]. Science Bulletin, 1988, (04) : 350 - 350

← 1 2 3 4 5 →