Abstract
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 language | English GB |
|---|---|
| Title of host publication | 2005 In-ternational Conference on Analysis of Algorithms, |
| Editors | Conrado Martínez |
| Place of Publication | Barcelona |
| Publisher | DMTCS |
| Pages | 335-342 |
| State | Published - 2005 |
Keywords
- Graph
- algorithm
- combinatorial optimization
- graph anticoloring
- separation