Abstract
An acyclic coloring of a graph \(G\) is a proper vertex coloring such that the induced subgraph of any two color classes is acyclic. The minimum number of colors needed to acyclically color the vertices of a graph \(G\) is called as acyclic chromatic number and is denoted by \(\chi_a(G)\). In this paper, we give the exact value of the acyclic chromatic number of Mycielskian graph of cycles, paths, complete graphs and complete bipartite graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
