NP-completeness results for some problems on subclasses of bipartite and chordal graphs

Extending previous NP-completeness results for the harmonious coloring problem and the pair-complete coloring problem on trees, bipartite graphs and cographs, we prove that these problems are also NP-complete on connected bipartite permutation graphs. We also study the k-path partition problem and, motivated by a recent work of Steiner [G. Steiner, On the k-path partition of graphs, Theoret. Comput. Sci. 290 (2003) 2147-2155], where he left the problem open for the class of convex graphs, we prove that the k-path partition problem is NP-complete on convex graphs. Moreover, we study the complexity of these problems on two well-known subclasses of chordal graphs namely quasi-threshold and threshold graphs. Based on the work of Bodlaender [H.L. Bodlaender, Achromatic number is NP-complete for cographs and interval graphs, Inform. Process. Lett. 31 (1989) 135-138], we show NP-completeness results for the pair-complete coloring and harmonious coloring problems on quasi-threshold graphs. Concerning the k-path partition problem, we prove that it is also NP-complete on this class of graphs. It is known that both the harmonious coloring problem and the k-path partition problem are polynomially solvable on threshold graphs. We show that the pair-complete coloring problem is also polynomially solvable on threshold graphs by describing a linear-time algorithm.

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

[2]  Stavros D. Nikolopoulos.  Recognizing cographs and threshold graphs through a classification of their edges , 2000, Inf. Process. Lett..

[3]  B. Bollobás.  Surveys in Combinatorics , 1979 .

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

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

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

[7]  R. Möhring.  Algorithmic graph theory and perfect graphs , 1986 .

[8]  Colin McDiarmid,et al.  The Complexity of Harmonious Colouring for Trees , 1995, Discret. Appl. Math..

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

[10]  Stavros D. Nikolopoulos.  Parallel algorithms for Hamiltonian problems on quasi-threshold graphs , 2004, J. Parallel Distributed Comput..

[11]  François Margot,et al.  Some Complexity Results about Threshold Graphs , 1994, Discret. Appl. Math..

[12]  Martin Farber,et al.  Concerning the achromatic number of graphs , 1986, J. Comb. Theory B.

[13]  John E. Hopcroft,et al.  On the Harmonious Coloring of Graphs , 1983 .

[14]  Jeremy P. Spinrad,et al.  Bipartite permutation graphs , 1987, Discret. Appl. Math..

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

[16]  George Steiner,et al.  On the k-path partition of graphs , 2003, Theor. Comput. Sci..

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

[18]  Gerard J. Chang,et al.  k-Path Partitions in Trees , 1997, Discret. Appl. Math..

[19]  Franco P. Preparata,et al.  Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems , 1981, Acta Informatica.

[20]  Keith Edwards,et al.  Some results on the achromatic number , 1997, J. Graph Theory.

[21]  P. Hammer,et al.  Aggregation of inequalities in integer programming. , 1975 .

[22]  Katerina Asdre,et al.  The harmonious coloring problem is NP-complete for interval and permutation graphs , 2007, Discret. Appl. Math..

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