Contractible Edges and Longest Cycles in 3-Connected Graphs

被引:0
|
作者
Egawa, Yoshimi [1 ]
Nakamura, Shunsuke [2 ]
机构
[1] Tokyo Univ Sci, Dept Appl Math, 1-3 Kagurazaka,Shinju Ku, Tokyo 1628601, Japan
[2] Natl Inst Technol, Kurume Coll, Dept Liberal Arts Sci & Math, 1-1-1 Komorino, Fukuoka 8308555, Japan
关键词
3-Connected graph; Contractible edge; Longest cycle; MAXIMUM NUMBER;
D O I
10.1007/s00373-022-02609-5
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We show that if G is a 3-connected graph of order at least 5, then there exists a longest cycle C of G such that the number of contractible edges of G which are on C is greater than or equal to (|E(C)| + 5) /6.
引用
收藏
页数:16
相关论文
共 50 条
  • [1] Contractible Edges and Longest Cycles in 3-Connected Graphs
    Yoshimi Egawa
    Shunsuke Nakamura
    Graphs and Combinatorics, 2023, 39
  • [2] LONGEST CYCLES IN 3-CONNECTED GRAPHS CONTAIN 3 CONTRACTIBLE EDGES
    DEAN, N
    HEMMINGER, RL
    OTA, K
    JOURNAL OF GRAPH THEORY, 1989, 13 (01) : 17 - 21
  • [3] Maximum number of contractible edges on longest cycles of a 3-connected graph
    Fujita, K
    ARS COMBINATORIA, 2005, 74 : 129 - 149
  • [4] Removable Edges and Chords of Longest Cycles in 3-Connected Graphs
    Jichang Wu
    Hajo Broersma
    Haiyan Kang
    Graphs and Combinatorics, 2014, 30 : 743 - 753
  • [5] Removable Edges and Chords of Longest Cycles in 3-Connected Graphs
    Wu, Jichang
    Broersma, Hajo
    Kang, Haiyan
    GRAPHS AND COMBINATORICS, 2014, 30 (03) : 743 - 753
  • [6] Contractible Edges and Removable Edges in 3-Connected Graphs
    Xu, Liqiong
    Guo, Xiaofeng
    GRAPHS AND COMBINATORICS, 2019, 35 (06) : 1375 - 1385
  • [7] Contractible Edges and Removable Edges in 3-Connected Graphs
    Liqiong Xu
    Xiaofeng Guo
    Graphs and Combinatorics, 2019, 35 : 1375 - 1385
  • [8] THE NUMBER OF CONTRACTIBLE EDGES IN 3-CONNECTED GRAPHS
    OTA, K
    GRAPHS AND COMBINATORICS, 1988, 4 (04) : 333 - 354
  • [9] Contractible Edges in 3-Connected Cubic Graphs
    Kou, Shuai
    Qin, Chengfu
    Yang, Weihua
    PARALLEL PROCESSING LETTERS, 2021, 31 (03)
  • [10] Longest cycles in 3-connected graphs
    Wei, B
    DISCRETE MATHEMATICS, 1997, 170 (1-3) : 195 - 201