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.
Original language | English |
---|---|
Pages (from-to) | 647-662 |
Number of pages | 16 |
Journal | Discrete Optimization |
Volume | 5 |
Issue number | 3 |
DOIs | |
State | Published - 1 Aug 2008 |
Keywords
- Algorithm
- Cayley graph
- Combinatorial optimization
- Graph
- Graph anticoloring
ASJC Scopus subject areas
- Theoretical Computer Science
- Computational Theory and Mathematics
- Applied Mathematics