Author/Authors :
مولا احمدي، اِ. نويسنده Department of Mathematical Sciences, Sharif University of Technology, Tehran, Iran Mollaahmadi, E. , سقاييان، س. نويسنده Department of Computer, Abadan Branch, Islamic Azad University, Abadan, Iran Saqaeeyan, S. , دهقان، ا. نويسنده Faculty of Mathematics and Computer Science, Amirkabir University of Technology, Tehran, Iran Dehghan, A.
Abstract :
The colorful paths and rainbow paths have been considered by several authors. A colorful
directed path in a digraph G is a directed path with (G) vertices whose colors are different. A v-
colorful directed path is such a directed path, starting from v. We prove that for a given 3-regular
triangle-free digraph G determining whether there is a proper (G)-coloring of G such that for every
v 2 V (G), there exists a v-colorful directed path is NP-complete.
