Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.