A Note on the Strong Edge-coloring of Outerplanar Graphs with Maximum Degree 3

被引：0
|
作者：
Shun-yi LIU [1 ,2 ]
He-ping ZHANG [1 ]
Hong-liang LU [3 ]
Yu-qing LIN [4 ]
机构：
[1] School of Mathematics and Statistics,Lanzhou University
[2] College of Science,Chang’an University
[3] School of Mathematics and Statistics,Xi’an Jiaotong University
[4] School of Electrical Engineering and Computer Science,The University of Newcastle
来源：
Acta Mathematicae Applicatae Sinica | 2016年 / 32卷 / 04期
基金：
中国国家自然科学基金; 中央高校基本科研业务费专项资金资助;
关键词：
strong edge-coloring; strong chromatic index; outerplanar graphs;
D O I：
暂无
中图分类号：
O157.5 [图论];
学科分类号：
070104 ;
摘要：
A strong k-edge-coloring of a graph G is an assignment of k colors to the edges of G in such a way that any two edges meeting at a common vertex,or being adjacent to the same edge of G,are assigned different colors.The strong chromatic index of G is the smallest integer k for which G has a strong k-edge-coloring.In this paper,we have shown that the strong chromatic index is no larger than 6 for outerplanar graphs with maximum degree 3.
引用
收藏
页码：883 / 890
页数：8
相关论文
共 50 条
  • [1] A Note on the Strong Edge-coloring of Outerplanar Graphs with Maximum Degree 3
    Liu, Shun-yi
    Zhang, He-ping
    Lu, Hong-liang
    Lin, Yu-qing
    ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2016, 32 (04): : 883 - 890
  • [2] A note on the strong edge-coloring of outerplanar graphs with maximum degree 3
    Shun-yi Liu
    He-ping Zhang
    Hong-liang Lu
    Yu-qing Lin
    Acta Mathematicae Applicatae Sinica, English Series, 2016, 32 : 883 - 890
  • [3] On strong edge-coloring of graphs with maximum degree 5
    Lu, Jian
    Liu, Huiqing
    Hu, Xiaolan
    DISCRETE APPLIED MATHEMATICS, 2024, 344 : 120 - 128
  • [4] On strong edge-coloring of graphs with maximum degree 4
    Lv, Jian-Bo
    Li, Xiangwen
    Yu, Gexin
    DISCRETE APPLIED MATHEMATICS, 2018, 235 : 142 - 153
  • [5] List strong edge-coloring of graphs with maximum degree 4
    Zhang, Baochen
    Chang, Yulin
    Hu, Jie
    Ma, Meijie
    Yang, Donglei
    DISCRETE MATHEMATICS, 2020, 343 (06)
  • [6] Strong edge-coloring of graphs with maximum degree 4 using 22 colors
    Cranston, Daniel W.
    DISCRETE MATHEMATICS, 2006, 306 (21) : 2772 - 2778
  • [7] Star edge-coloring of graphs with maximum degree four
    Wang, Ying
    Wang, Yiqiao
    Wang, Weifan
    APPLIED MATHEMATICS AND COMPUTATION, 2019, 340 : 268 - 275
  • [8] On injective edge-coloring of graphs with maximum degree 4
    Fu, Jiacong
    Lv, Jian-Bo
    DISCRETE APPLIED MATHEMATICS, 2025, 360 : 1 - 12
  • [9] Injective edge-coloring of graphs with given maximum degree
    Kostochka, Alexandr
    Raspaud, Andre
    Xu, Jingwei
    EUROPEAN JOURNAL OF COMBINATORICS, 2021, 96
  • [10] OPTIMALLY EDGE-COLORING OUTERPLANAR GRAPHS IS IN NC
    GIBBONS, A
    RYTTER, W
    THEORETICAL COMPUTER SCIENCE, 1990, 71 (03) : 401 - 411
12345