A Reduction of the Anticoloring Problem to Connected Graphs
Electronic Notes in Discrete Mathematics(2007)
摘要
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.
更多查看译文
关键词
Graph,disconnected graph,algorithm,combinatorial optimization,graph anticoloring
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要