期刊
AIMS MATHEMATICS
卷 7, 期 6, 页码 10828-10841出版社
AMER INST MATHEMATICAL SCIENCES-AIMS
DOI: 10.3934/math.2022605
关键词
acyclic edge coloring; planar graph; cycle; girth; maximum degree
资金
- National Natural Science Foundations of China [11771403, 11901243]
In this paper, we investigate the acyclic chromatic index of planar graphs without 3-cycles and intersecting 4-cycles. We prove that the acyclic chromatic index is less than or equal to the maximum degree plus 1 when the maximum degree is greater than or equal to 8.
An acyclic edge coloring of a graph G is a proper edge coloring such that no bichromatic cycles are produced. The acyclic chromatic index of G, denoted by chi(a)' (G), is the smallest integer k such that G is acyclically edge k-colorable. In this paper, we consider the planar graphs without 3-cycles and intersecting 4-cycles, and prove that chi(a)' (G) <= Delta(G) + 1 if Delta(G) >= 8.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据