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 条
  • [21] On the pancyclicity of 1-tough graphs
    Li, Rao
    DISCRETE MATHEMATICS LETTERS, 2021, 5 : 1 - 4
  • [22] ON THE CIRCUMFERENCES OF 1-TOUGH GRAPHS
    TIAN, YC
    ZHAO, LC
    KEXUE TONGBAO, 1988, 33 (07): : 538 - 541
  • [23] 1-tough cocomparability graphs are Hamiltonian
    Deogun, JS
    Kratsch, D
    Steiner, G
    DISCRETE MATHEMATICS, 1997, 170 (1-3) : 99 - 106
  • [24] 1-tough cocomparability graphs are hamiltonian
    Discrete Math, 1-3 (99-106):
  • [25] Longest Paths and Longest Cycles in Graphs with Large Degree Sums
    Ingo Schiermeyer
    Meike Tewes
    Graphs and Combinatorics, 2002, 18 : 633 - 643
  • [26] Longest paths and longest cycles in graphs with large degree sums
    Schiermeyer, I
    Tewes, M
    GRAPHS AND COMBINATORICS, 2002, 18 (03) : 633 - 643
  • [27] Characterization of 1-tough graphs using factors
    Lu, Hongliang
    Kano, Mikio
    DISCRETE MATHEMATICS, 2020, 343 (08)
  • [28] Partitioning vertices of 1-tough graphs into paths
    Bazgan, C
    Harkat-Benhamdine, A
    Li, H
    Wozniak, M
    THEORETICAL COMPUTER SCIENCE, 2001, 263 (1-2) : 255 - 261
  • [29] FORBIDDEN SUBGRAPHS FOR HAMILTONICITY OF 1-TOUGH GRAPHS
    Li, Binlong
    Broersma, Hajo J.
    Zhang, Shenggui
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2016, 36 (04) : 915 - 929
  • [30] On the shortness exponent of 1-tough, maximal planar graphs
    Tkac, M
    DISCRETE MATHEMATICS, 1996, 154 (1-3) : 321 - 328
12345