Strong Edge-Coloring of Pseudo-Halin Graphs

被引：1
|
作者：
Li, Xiangwen [1 ]
Lv, Jian-Bo [1 ,2 ]
机构：
[1] Cent China Normal Univ, Dept Math, Wuhan 430079, Peoples R China
[2] Guangxi Normal Univ, Dept Math, Guilin 541000, Peoples R China
来源：
BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY | 2020年 / 43卷 / 01期
关键词：
Strong edge-coloring; Strong chromatic index; Halin graphs; Pseudo-Halin graphs; STRONG CHROMATIC INDEX;
D O I：
10.1007/s40840-019-00718-8
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A strong edge-coloring of a graph G is a proper edge-coloring such that every path of length 3 uses three different colors. The strong chromatic index of a graph G, denoted by chi'(s) (G), is the minimum number of colors needed for a strong edge-coloring of G. In this paper, we show that chi'(s) (G) <= 3 Delta - 2 for any pseudo-Halin graph G with Delta >= 4.
引用
收藏
页码：893 / 910
页数：18
相关论文
共 50 条
  • [41] ACYCLIC EDGE-COLORING OF PLANAR GRAPHS
    Basavaraju, Manu
    Chandran, L. Sunil
    Cohen, Nathann
    Havet, Frederic
    Mueller, Tobias
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2011, 25 (02) : 463 - 478
  • [42] The edge-coloring of graphs with small genus
    Fan, HL
    Fu, HL
    [J]. ARS COMBINATORIA, 2004, 73 : 219 - 224
  • [43] Note on injective edge-coloring of graphs
    Miao, Zhengke
    Song, Yimin
    Yu, Gexin
    [J]. DISCRETE APPLIED MATHEMATICS, 2022, 310 : 65 - 74
  • [44] Decompositions for edge-coloring join graphs and cobipartite graphs
    Machado, Raphael C. S.
    de Figueiredo, Celina M. N.
    [J]. DISCRETE APPLIED MATHEMATICS, 2010, 158 (12) : 1336 - 1342
  • [45] Adjacent vertex-distinguishing proper edge-coloring of strong product of graphs
    Anantharaman, S.
    [J]. APPLICATIONS AND APPLIED MATHEMATICS-AN INTERNATIONAL JOURNAL, 2019, 14 (02): : 1169 - 1187
  • [46] Strong edge-coloring of graphs with maximum degree 4 using 22 colors
    Cranston, Daniel W.
    [J]. DISCRETE MATHEMATICS, 2006, 306 (21) : 2772 - 2778
  • [47] IMPROVED EDGE-COLORING ALGORITHMS FOR PLANAR GRAPHS
    CHROBAK, M
    NISHIZEKI, T
    [J]. JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1990, 11 (01): : 102 - 116
  • [48] Edge-coloring critical graphs with high degree
    Miao, LY
    Wu, JL
    [J]. DISCRETE MATHEMATICS, 2002, 257 (01) : 169 - 172
  • [49] List Edge-Coloring and Total Coloring in Graphs of Low Treewidth
    Bruhn, Henning
    Lang, Richard
    Stein, Maya
    [J]. JOURNAL OF GRAPH THEORY, 2016, 81 (03) : 272 - 282
  • [50] On the vertex distinguishing equitable edge-coloring of graphs
    Zhang, Zhong-fu
    Li, Mu-chun
    Yao, Bing
    Xu, Bo-gen
    Wang, Zhi-wen
    Li, Jing-wen
    [J]. ARS COMBINATORIA, 2008, 86 : 193 - 200
12345