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.

[1]  Mihalis Yannakakis,et al.  Edge Dominating Sets in Graphs , 1980 .

[2]  Frank Harary,et al.  An interpolation theorem for graphical homomorphisms , 1967 .

[3]  S. Hedetniemi,et al.  The achromatic number of a graph , 1970 .

[4]  Alan A. Bertossi,et al.  Total Domination in Interval Graphs , 1986, Inf. Process. Lett..

[5]  Hans L. Bodlaender,et al.  Achromatic Number is NP-Complete for Cographs and Interval Graphs , 1989, Inf. Process. Lett..

[6]  Katerina Asdre,et al.  NP-completeness results for some problems on subclasses of bipartite and chordal graphs , 2007, Theor. Comput. Sci..

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  Joseph Y.-T. Leung,et al.  Efficient algorithms for interval graphs and circular-arc graphs , 1982, Networks.

[9]  David S. Johnson,et al.  `` Strong '' NP-Completeness Results: Motivation, Examples, and Implications , 1978, JACM.

[10]  Keith Edwards,et al.  Some results on the achromatic number , 1997 .

[11]  S. Olariu,et al.  An optimal path cover algorithm for cographs , 1995 .

[12]  M. Golumbic.  Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57) , 2004 .

[13]  C. Pandu Rangan,et al.  Linear Algorithm for Optimal Path Cover Problem on Interval Graphs , 1990, Inf. Process. Lett..

[14]  Peter L. Hammer,et al.  Discrete Applied Mathematics , 1993 .

[15]  J. Mark Keil.  Finding Hamiltonian Circuits in Interval Graphs , 1985, Inf. Process. Lett..

[16]  A. Brandstädt,et al.  Graph Classes: A Survey , 1987 .

[17]  Keith Edwards,et al.  The harmonious chromatic number and the achromatic number , 1997 .

[18]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[19]  Derek G. Corneil,et al.  Complement reducible graphs , 1981, Discret. Appl. Math..