Acyclic Edge Coloring of Planar Graphs without Adjacent Triangles

被引：0
|
作者：
Dezheng XIE Yanqing WU College of Mathematics and StatisticsChongqing UniversityChongqing PRChinaSchool of Mathematics and Computer ScienceShanxi Normal UniversityShanxi PRChina [1 ,1 ,2 ,1 ,401331 ,2 ,41000 ]
机构：
来源：
数学研究及应用 | 2012年 / 32卷 / 04期
关键词：
D O I：
暂无
中图分类号：
O157.5 [图论];
学科分类号：
摘要：
An acyclic edge coloring of a graph G is a proper edge coloring such that there are no bichromatic cycles.The acyclic edge chromatic number of a graph G is the minimum number k such that there exists an acyclic edge coloring using k colors and is denoted by χ' a(G).In this paper we prove that χ ' a(G) ≤(G) + 5 for planar graphs G without adjacent triangles.
引用
收藏
页码：407 / 414
页数：8
相关论文
共 50 条
  • [1] Acyclic Edge Coloring of Planar Graphs without Adjacent Triangles
    Dezheng XIE 1
    2.School of Mathematics and Computer Science
    Journal of Mathematical Research with Applications, 2012, (04) : 407 - 414
  • [2] On acyclic edge coloring of planar graphs without intersecting triangles
    Sheng, Ping
    Wang, Yingqian
    DISCRETE MATHEMATICS, 2011, 311 (21) : 2490 - 2495
  • [3] Acyclic edge coloring of planar graphs without adjacent cycles
    Min Wan
    BaoGang Xu
    Science China Mathematics, 2014, 57 : 433 - 442
  • [4] Acyclic edge coloring of planar graphs without adjacent cycles
    WAN Min
    XU BaoGang
    ScienceChina(Mathematics), 2014, 57 (02) : 433 - 442
  • [5] Acyclic edge coloring of planar graphs without adjacent cycles
    Wan Min
    Xu BaoGang
    SCIENCE CHINA-MATHEMATICS, 2014, 57 (02) : 433 - 442
  • [6] Acyclic edge coloring of planar graphs without a -cycle adjacent to a -cycle
    Wang, Yiqiao
    Shu, Qiaojun
    Wu, Jian-Liang
    Zhang, Wenwen
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2014, 28 (03) : 692 - 715
  • [7] Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles
    Shu, Qiaojun
    Chen, Yong
    Han, Shuguang
    Lin, Guohui
    Miyano, Eiji
    Zhang, An
    THEORETICAL COMPUTER SCIENCE, 2021, 882 : 77 - 108
  • [8] Acyclic Edge Coloring Conjecture Is True on Planar Graphs Without Intersecting Triangles
    Shu, Qiaojun
    Chen, Yong
    Han, Shuguang
    Lin, Guohui
    Miyano, Eiji
    Zhang, An
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2020, 2020, 12337 : 426 - 438
  • [9] Acyclic Edge Coloring of Planar Graphs Without Small Cycles
    Jianfeng Hou
    Guizhen Liu
    Jianliang Wu
    Graphs and Combinatorics, 2012, 28 : 215 - 226
  • [10] Acyclic Edge Coloring of Planar Graphs Without Small Cycles
    Hou, Jianfeng
    Liu, Guizhen
    Wu, Jianliang
    GRAPHS AND COMBINATORICS, 2012, 28 (02) : 215 - 226
12345