Abstract
An anticoloring of a graph is a partial coloring of the vertices in which no two adjacent vertices are colored in distinct colors. In the basic anticoloring problem, we are given a graph G and positive integers B1,…,Bk, and have to determine whether there exists an anticoloring of G such that Bj vertices are colored in color j, 1≤j≤k. This problem is known to be NP-complete, even for two colors.We deal with the anticoloring problem on the rook’s graph. In general, we are able to provide sub-linear algorithms. In some particular cases, we give an explicit formula for the optimal solution.
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.
