Adjacent vertex distinguishing acyclic edge coloring of the Cartesian product of graphs
Let $G$ be a graph and $chi^{prime}_{aa}(G)$ denotes the minimum number of colors required for an acyclic edge coloring of $G$ in which no two adjacent vertices are incident to edges colored with the same set of colors. We prove a general bound for $chi^{prime}_{aa}(Gsquare H)$ for any two grap...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Isfahan
2017-06-01
|
| Series: | Transactions on Combinatorics |
| Subjects: | |
| Online Access: | http://toc.ui.ac.ir/article_20988_dc6050dc4f36dd95fd12e657ff895814.pdf |