Anticoloring of a family of grid graphs |
| |
| Institution: | 1. Departments of Mathematics and Computer Science, Ben-Gurion University, Beer Sheva 84105, Israel;2. Department of Industrial Engineering and Management, Ben-Gurion University, Beer Sheva 84105, Israel;3. Department of Computer Science, Ben-Gurion University, Beer Sheva 84105, Israel |
| |
| 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. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
