Anticoloring of the rook's graph

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


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.

Original languageEnglish
Pages (from-to)1-15
Number of pages15
JournalDiscrete Applied Mathematics
Issue number1
StatePublished - 1 Jan 2015


  • Anticoloring
  • Rook's graph

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics


Dive into the research topics of 'Anticoloring of the rook's graph'. Together they form a unique fingerprint.

Cite this