Acyclic edge coloring of triangle-free 1-planar graphs |
| |
| Authors: | Wen Yao Song Lian Ying Miao |
| |
| Institution: | Institute of Mathematics, China University of Mining and Technology, Xuzhou 221116, P. R. China |
| |
| Abstract: | A proper edge coloring of a graph G is acyclic if there is no 2-colored cycle in G. The acyclic chromatic index of G, denoted by χ'a(G), is the least number of colors such that G has an acyclic edge coloring. A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, it is proved that χ'a(G) ≤ Δ(G)+22, if G is a triangle-free 1-planar graph. |
| |
| Keywords: | Acyclic chromatic index acyclic edge coloring 1-planar graph |
| 本文献已被 CNKI SpringerLink 等数据库收录！ |
| 点击此处可从《数学学报(英文版)》浏览原始摘要信息 |
| 点击此处可从《数学学报(英文版)》下载免费的PDF全文 |
