The Tight Bound for the Strong Chromatic Indices of Claw-Free Subcubic Graphs

被引:0
|
作者
Lin, Yuquan [1 ]
Lin, Wensong [1 ]
机构
[1] Southeast Univ, Sch Math, Nanjing 210096, Peoples R China
关键词
Strong edge coloring; Strong chromatic index; Claw-free graph; Subcubic graph; MAXIMUM DEGREE 4;
D O I
10.1007/s00373-023-02655-7
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Let G be a graph and k a positive integer. A strong k-edge-coloring of G is a mapping phi : E(G) -> {1, 2,..., k} such that for any two edges e and e' that are either adjacent to each other or adjacent to a common edge, phi(e) not equal phi(e'). The strong chromatic index of G, denoted as chi(')(s)(G), is the minimum integer k such that G has a strong k-edge-coloring. Lv, Li and Zhang [Graphs and Combinatorics 38 (3) (2022) 63] proved that if G is a claw-free subcubic graph other than the triangular prism then chi(')(s)(G) <= 8. In addition, they asked if the upper bound 8 can be improved to 7. In this paper, we answer this question in the affirmative. Our proof implies a polynomial-time algorithm for finding strong 7-edge-colorings of such graphs. We also construct infinitely many claw-free subcubic graphs with their strong chromatic indices attaining the bound 7.
引用
收藏
页数:17
相关论文
共 50 条
  • [1] The Tight Bound for the Strong Chromatic Indices of Claw-Free Subcubic Graphs
    Yuquan Lin
    Wensong Lin
    [J]. Graphs and Combinatorics, 2023, 39
  • [2] On Strong Edge-Coloring of Claw-Free Subcubic Graphs
    Jian-Bo Lv
    Jianxi Li
    Xiaoxia Zhang
    [J]. Graphs and Combinatorics, 2022, 38
  • [3] On Strong Edge-Coloring of Claw-Free Subcubic Graphs
    Lv, Jian-Bo
    Li, Jianxi
    Zhang, Xiaoxia
    [J]. GRAPHS AND COMBINATORICS, 2022, 38 (03)
  • [4] Decomposing claw-free subcubic graphs and 4-chordal subcubic graphs
    Aboomahigir, Elham
    Ahanjideh, Milad
    Akbari, Saieed
    [J]. DISCRETE APPLIED MATHEMATICS, 2021, 296 : 52 - 55
  • [5] Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs
    Cheng, Christine
    McDermid, Eric
    Suzuki, Ichiro
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2011, 6986 : 107 - 118
  • [6] Strong Cliques in Claw-Free Graphs
    Debski, Michal
    Sleszynska-Nowak, Malgorzata
    [J]. GRAPHS AND COMBINATORICS, 2021, 37 (06) : 2581 - 2593
  • [7] Strong Cliques in Claw-Free Graphs
    Michał Dębski
    Małgorzata Śleszyńska-Nowak
    [J]. Graphs and Combinatorics, 2021, 37 : 2581 - 2593
  • [8] Partitioning Claw-Free Subcubic Graphs into Two Dominating Sets
    Cui, Qing
    [J]. GRAPHS AND COMBINATORICS, 2020, 36 (06) : 1723 - 1740
  • [9] The Injective Chromatic Index of a Claw-Free Subcubic Graph is at Most 6
    Xiaoyuan DONG
    Yuquan LIN
    Wensong LIN
    [J]. Journal of Mathematical Research with Applications, 2023, 43 (04) : 409 - 416
  • [10] Injective edge-coloring of claw-free subcubic graphs
    Cui, Qing
    Han, Zhenmeng
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2024, 47 (05)