Acyclic edge coloring of planar graphs
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 χ′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...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
American Institute of Mathematical Sciences
2022
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher |