| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1141885 | Discrete Optimization | 2008 | 16 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Control and Optimization
Authors
D. Berend, E. Korach, S. Zucker,