Two-anticoloring of planar and related graphs

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


An \textit{anticoloring} of a graph is a coloring of some of the \nvertices,\nsuch that no two adjacent vertices are colored in distinct colors. We \ndeal\nwith the anticoloring problem with two colors for planar graphs, and, \nusing\nLipton and Tarjan's separation algorithm, provide an algorithm with \nsome\nbound on the error. In the particular cases of graphs which are strong \nproducts\nof two paths or two cycles, we provide an explicit optimal solution.
Original languageEnglish GB
Title of host publication2005 In-ternational Conference on Analysis of Algorithms,
EditorsConrado Martínez
Place of PublicationBarcelona
StatePublished - 2005


  • Graph
  • algorithm
  • combinatorial optimization
  • graph anticoloring
  • separation


Dive into the research topics of 'Two-anticoloring of planar and related graphs'. Together they form a unique fingerprint.

Cite this