科研之友
微信
新浪微博
Facebook
分享链接
摘要
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, such colorings with many vertices colored in each color. We deal with the anticoloring problem for planar graphs and, using Lipton and Tarjan's separation algorithm, provide an algorithm with some bound on the error. We also show that, to solve the anticoloring problem for general graphs, it suffices to solve it for connected graphs.
- 出版日期2010-2-6
