Strong edge-coloring for planar graphs with large girth

被引：2
|
作者：
Chen, Lily [1 ]
Deng, Kecai [1 ]
Yu, Gexin [2 ,3 ]
Zhou, Xiangqian [1 ,4 ]
机构：
[1] Huaqiao Univ, Sch Math Sci, Quanzhou, Peoples R China
[2] Cent China Normal Univ, Sch Math & Stat, Wuhan, Hubei, Peoples R China
[3] Coll William & Mary, Dept Math, Williamsburg, VA 23185 USA
[4] Wright State Univ, Dept Math & Stat, Dayton, OH 45435 USA
来源：
DISCRETE MATHEMATICS | 2019年 / 342卷 / 02期
关键词：
Planar graph; Strong edge-coloring; Girth; STRONG CHROMATIC INDEX;
D O I：
10.1016/j.disc.2018.10.019
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A strong edge-coloring of a graph G = (V, E) is a partition of its edge set E into induced matchings. Let G be a connected planar graph with girth k >= 26 and maximum degree Delta. We show that either G is isomorphic to a subgraph of a very special Delta-regular graph with girth k, or G has a strong edge-coloring using at most 2 Delta + inverted right perpendicular 12(Delta-2)/k inverted left perpendicular colors. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码：339 / 343
页数：5
相关论文
共 50 条
  • [1] Strong edge-coloring of planar graphs with girth at least seven
    Yuan, Jiaxin
    Huang, Mingfang
    [J]. ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2024, (51): : 295 - 304
  • [2] Strong edge-coloring of planar graphs
    Hudak, David
    Luzar, Borut
    Sotak, Roman
    Skrekovski, Riste
    [J]. DISCRETE MATHEMATICS, 2014, 324 : 41 - 49
  • [3] STRONG EDGE-COLORING OF PLANAR GRAPHS
    Song, Wen-Yao
    Miao, Lian-Ying
    [J]. DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2017, 37 (04) : 845 - 857
  • [4] Acyclic edge coloring of planar graphs with large girth
    Yu, Dongxiao
    Hou, Jianfeng
    Liu, Guizhen
    Liu, Bin
    Xu, Lan
    [J]. THEORETICAL COMPUTER SCIENCE, 2009, 410 (47-49) : 5196 - 5200
  • [5] Adjacent vertex distinguishing edge-coloring of planar graphs with girth at least five
    Xu, Xinping
    Zhang, Yiying
    [J]. ARS COMBINATORIA, 2014, 116 : 359 - 369
  • [6] 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
  • [7] Strong edge-coloring for jellyfish graphs
    Chang, Gerard J.
    Chen, Sheng-Hua
    Hsu, Chi-Yun
    Hung, Chia-Man
    Lai, Huei-Ling
    [J]. DISCRETE MATHEMATICS, 2015, 338 (12) : 2348 - 2355
  • [8] IMPROVED EDGE-COLORING ALGORITHMS FOR PLANAR GRAPHS
    CHROBAK, M
    NISHIZEKI, T
    [J]. JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1990, 11 (01): : 102 - 116
  • [9] The strong edge-coloring for graphs with small edge weight
    Chen, Lily
    Huang, Mingfang
    Yu, Gexin
    Zhou, Xiangqian
    [J]. DISCRETE MATHEMATICS, 2020, 343 (04)
  • [10] From edge-coloring to strong edge-coloring
    Borozan, Valentin
    Chang, Gerard Jennhwa
    Cohen, Nathann
    Fujita, Shinya
    Narayanan, Narayanan
    Naserasr, Reza
    Valicov, Petru
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2015, 22 (02):
12345