| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652870 | Electronic Notes in Discrete Mathematics | 2007 | 7 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. The anticoloring problem seeks, roughly speaking, for such colorings with many vertices colored in each color. We show that, to solve the anticoloring problem with two colors for general graphs, it suffices to solve it for connected graphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
