Anticoloring of a family of grid graphs

D. Berend, E. Korach, S. Zucker

Research output: Contribution to journalArticlepeer-review

9 Scopus citations


An anticoloring of a graph is a coloring of some of the vertices, such that no two adjacent vertices are colored in distinct colors. We deal with the anticoloring problem with two colors, in the particular cases of graphs which are strong products of two paths or two cycles, and provide an explicit optimal solution.

Original languageEnglish
Pages (from-to)647-662
Number of pages16
JournalDiscrete Optimization
Issue number3
StatePublished - 1 Aug 2008


  • Algorithm
  • Cayley graph
  • Combinatorial optimization
  • Graph
  • Graph anticoloring

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics
  • Applied Mathematics


Dive into the research topics of 'Anticoloring of a family of grid graphs'. Together they form a unique fingerprint.

Cite this