Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On the complexity of deciding whether the distinguishing chromatic
  number of a graph is at most two   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.

37
The categories of this paper are: supr-con
31
The categories of this paper are: ao-sci
21
The categories of this paper are: adap-org
6
The categories of this paper are: astro-ph
18
The categories of this paper are: econ
10
The categories of this paper are: q-bio
26
The categories of this paper are: bayes-an
2
The categories of this paper are: math
9
The categories of this paper are: nlin
35
The categories of this paper are: mtrl-th
22
The categories of this paper are: chao-dyn
23
The categories of this paper are: solv-int
33
The categories of this paper are: plasm-ph
28
The categories of this paper are: alg-geom
8
The categories of this paper are: hep-ex
17
The categories of this paper are: q-fin