Further Results on Harmonious Colorings of Digraphs

Let D be a directed graph with n vertices and m edges. A function f: V(D) → {1, 2, 3, …, t}, where t ≤ n is said to be a harmonious coloring of D if for any two edges xy and uv of D, the ordered pa...