Sciweavers

Share
DAM
2007

The harmonious coloring problem is NP-complete for interval and permutation graphs

12 years 1 months ago
The harmonious coloring problem is NP-complete for interval and permutation graphs
In this paper, we prove that the harmonious coloring problem is NP-complete for connected interval and permutation graphs. Given a simple graph G, a harmonious coloring of G is a proper vertex coloring such that each pair of colors appears together on at most one edge. The harmonious chromatic number is the least integer k for which G admits a harmonious coloring with k colors. Extending previous work on the NP-completeness of the harmonious coloring problem when restricted to the class of disconnected graphs which are simultaneously cographs and interval graphs, we prove that the problem is also NP-complete for connected interval and permutation graphs. © 2007 Elsevier B.V. All rights reserved.
Katerina Asdre, Kyriaki Ioannidou, Stavros D. Niko
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2007
Where DAM
Authors Katerina Asdre, Kyriaki Ioannidou, Stavros D. Nikolopoulos
Comments (0)
books