Long Cycles in 1-Tough Graphs With Large Degree Sums

被引：0

作者：

张莲珠

李建平

田丰

机构：

[1] Institute of Systems Science Academia Sinica Beijing 100080 PRC

[2] Department of Mathematics Yunnan University Kunming 650091 PRC

[3] Department of Mathematics Zhangzhou Normal College Zhangzhou 363000 PRC

来源：

Chinese Science Bulletin | 1993年 / 07期

关键词：

Long Cycles in 1-Tough Graphs With Large Degree Sums;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

For a graph G, we denote by c(G) the circumference of G, and let σ(G)=min{sum from i=1 to 3 d(v):{v, v, v} is an independent set in G},(G)=min{sum from i=1 to 3 d(v)-|N(v)|:{v, v, v} is an independent set in G}, ρ(G)=min{|N(v)|:{v, v, v} is an independent set in G} and

引用

页码：613 / 613

页数：1

共 50 条

[1] LONG CYCLES IN 1-TOUGH GRAPHS WITH LARGE DEGREE SUMS
ZHANG, LZ
LI, JP
TIAN, F
CHINESE SCIENCE BULLETIN, 1993, 38 (07): : 613 - 613
[2] Cycles containing many vertices of subsets in 1-tough graphs with large degree sums
Li, JP
ARS COMBINATORIA, 1998, 48 : 195 - 212
[3] A SUFFICIENT CONDITION ON DEGREE SUMS OF INDEPENDENT TRIPLES FOR HAMILTONIAN CYCLES IN 1-TOUGH GRAPHS
FASSBENDER, B
ARS COMBINATORIA, 1992, 33 : 300 - 304
[4] A SHARP LOWER-BOUND FOR THE CIRCUMFERENCE OF 1-TOUGH GRAPHS WITH LARGE DEGREE SUMS
HOA, VD
JOURNAL OF GRAPH THEORY, 1995, 20 (02) : 137 - 140
[5] THE HAMILTONIAN CYCLES OF 1-TOUGH GRAPHS
田永成
ChineseScienceBulletin, 1991, (03) : 262 - 262
[6] THE HAMILTONIAN CYCLES OF 1-TOUGH GRAPHS
TIAN, YC
CHINESE SCIENCE BULLETIN, 1991, 36 (03): : 262 - 262
[7] Hamiltonian cycles in 1-tough graphs
Wei, B
GRAPHS AND COMBINATORICS, 1996, 12 (04) : 385 - 395
[8] ON THE LONGEST CYCLES OF 1-TOUGH GRAPHS
TIAN, YC
CHINESE SCIENCE BULLETIN, 1989, 34 (14): : 1228 - 1228
[9] ON THE LONGEST CYCLES OF 1-TOUGH GRAPHS
田永成
ChineseScienceBulletin, 1989, (14) : 1228 - 1228
[10] LONG CYCLES IN GRAPHS WITH LARGE DEGREE SUMS
BAUER, D
VELDMAN, HJ
MORGANA, A
SCHMEICHEL, EF
DISCRETE MATHEMATICS, 1990, 79 (01) : 59 - 70

← 1 2 3 4 5 →