On the complexity of the colorful directed paths in vertex coloring of digraphs
The colorful paths and rainbow paths have been considered by severalauthors.A colorful directed path in a digraph $G$ is a directed path with $chi(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 t...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Isfahan
2013-06-01
|
| Series: | Transactions on Combinatorics |
| Subjects: | |
| Online Access: | http://www.combinatorics.ir/?_action=showPDF&article=2840&_ob=f9b7ae159e5664714beed10049e011af&fileName=full_text.pdf. |