New upper bounds on harmonious colorings
Journal of Graph Theory
The complexity of harmonious colouring for trees
Discrete Applied Mathematics - Special issue: Combinatorial Optimization 1992 (CO92)
NP-completeness results for some problems on subclasses of bipartite and chordal graphs
Theoretical Computer Science
Note: The harmonious coloring problem is NP-complete for interval and permutation graphs
Discrete Applied Mathematics
| Hi-index | 0.04 |
We consider the extension to directed graphs of the concepts of harmonious colouring and complete colouring. We give an upper bound for the harmonious chromatic number of a general directed graph, and show that determining the exact value of the harmonious chromatic number is NP-hard for directed graphs of bounded degree (in fact graphs with maximum indegree and outdegree 2); the complexity of the corresponding undirected case is not known. We also consider complete colourings, and show that in the directed case the existence of a complete colouring is NP-complete. We also show that the interpolation property for complete colourings fails in the directed case.