On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two

Details On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two

2009-07-03

arxiv.org/abs/0907.0691v1

Computer Science

Computational Complexity

Scientific paper

In an article [3] published recently in this journal, it was shown that when
k >= 3, the problem of deciding whether the distinguishing chromatic number of
a graph is at most k is NP-hard. We consider the problem when k = 2. In regards
to the issue of solvability in polynomial time, we show that the problem is at
least as hard as graph automorphism but no harder than graph isomorphism.

Affiliated with

Also associated with

No associations

Rating

On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-706243