Daniel Berend
Senior Academic
Anticoloring of a family of grid graphs
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.
| Publication language | English |
| Pages | 647-662 |
| Journal | Discrete Optimization |
| Volume | 5 |
| Issue number | 3 |
| Publication status | Published - 01.08.2008 |
Keywords
Algorithm
Cayley graph
Combinatorial optimization
Graph
Graph anticoloring
ASJC Scopus subject areas
Theoretical Computer Science
Computational Theory and Mathematics
Applied Mathematics
