ON THE COMPLEXITY OF THE COLORFUL DIRECTED PATHS IN VERTEX COLORING OF DIGRAPHS

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

SAQAEEYAN S.; MOLLAAHMADI E.; DEHGHAN A.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: TRANSACTIONS ON COMBINATORICS Year:2013 | Volume:2 | Issue:2 Page(s): 1-7

Download Full-Text

Persian Verion

View:

836

Download:

213

Cites:

Information Journal Paper

Title

ON THE COMPLEXITY OF THE COLORFUL DIRECTED PATHS IN VERTEX COLORING OF DIGRAPHS

Author(s)

SAQAEEYAN S. | MOLLAAHMADI E. | DEHGHAN A. | Issue Writer Certificate

Keywords

COLORFUL DIRECTED PATHSQ2

COMPUTATIONAL COMPLEXITYQ2

VERTEX COLORINGQ2

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 X (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 X (G)-coloring of G such that for every vÎV (G), there exists a v-colorful directed path is NP-complete.

Cites

No record.

References

No record.

Cite

APA: Copy

SAQAEEYAN, S., MOLLAAHMADI, E., & DEHGHAN, A.. (2013). ON THE COMPLEXITY OF THE COLORFUL DIRECTED PATHS IN VERTEX COLORING OF DIGRAPHS. TRANSACTIONS ON COMBINATORICS, 2(2), 1-7. SID. https://sid.ir/paper/213755/en

Vancouver: Copy

SAQAEEYAN S., MOLLAAHMADI E., DEHGHAN A.. ON THE COMPLEXITY OF THE COLORFUL DIRECTED PATHS IN VERTEX COLORING OF DIGRAPHS. TRANSACTIONS ON COMBINATORICS[Internet]. 2013;2(2):1-7. Available from: https://sid.ir/paper/213755/en

IEEE: Copy

S. SAQAEEYAN, E. MOLLAAHMADI, and A. DEHGHAN, “ON THE COMPLEXITY OF THE COLORFUL DIRECTED PATHS IN VERTEX COLORING OF DIGRAPHS,” TRANSACTIONS ON COMBINATORICS, vol. 2, no. 2, pp. 1–7, 2013, [Online]. Available: https://sid.ir/paper/213755/en

Related Journal Papers