A Reduction of the Anticoloring Problem to Connected Graphs

D. Berend, E. Korach, S. Zucker

Research output: Contribution to journalArticlepeer-review

3 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. The anticoloring problem seeks, roughly speaking, for such colorings with many vertices colored in each color. We show that, to solve the anticoloring problem with two colors for general graphs, it suffices to solve it for connected graphs.

Original languageEnglish
Pages (from-to)445-451
Number of pages7
JournalElectronic Notes in Discrete Mathematics
StatePublished - 1 Mar 2007


  • Graph
  • algorithm
  • combinatorial optimization
  • disconnected graph
  • graph anticoloring

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics


Dive into the research topics of 'A Reduction of the Anticoloring Problem to Connected Graphs'. Together they form a unique fingerprint.

Cite this