Anticoloring and separation of graphs

D. Berend, E. Korach, S. Zucker

Research output: Contribution to journalArticlepeer-review

2 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, such colorings with many vertices colored in each color. We deal with the anticoloring problem for planar graphs and, using Lipton and Tarjan's separation algorithm, provide an algorithm with some bound on the error. We also show that, to solve the anticoloring problem for general graphs, it suffices to solve it for connected graphs.

Original languageEnglish
Pages (from-to)390-399
Number of pages10
JournalDiscrete Mathematics
Issue number3
StatePublished - 6 Feb 2010


  • Algorithm
  • Combinatorial optimization
  • Disconnected graph
  • Graph anticoloring
  • Planar graph
  • Separation

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


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

Cite this