Title of article
A Reduction of the Anticoloring Problem to Connected Graphs
Author/Authors
Berend، نويسنده , , D. and Korach، نويسنده , , E. and Zucker، نويسنده , , S.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
7
From page
445
To page
451
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.
Keywords
disconnected graph , graph , algorithm , Combinatorial optimization , graph anticoloring
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2007
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454621
Link To Document