APPROXIMATION ALGORITHMS FOR THE ACHROMATIC NUMBER OF CERTAIN GRACEFUL GRAPHS

2020 Journal of Critical Reviews  
The achromatic number for a graph G = (V, E) is the largest integer m such that there is a partition of V into disjoint independent sets (V1,...,Vm) satisfying the condition that for each pair of distinct sets , , ∪ is not an independent set in G. In this paper, we present O(1) approximation algorithms to determine the achromatic number of certain graceful graphs.
doi:10.31838/jcr.07.05.235 fatcat:ielqlgbr4rhknghgqud3o2az6i