1 paper
Rian Febrian Umbara, A. N. M. Salman, Pritta Etriana Putri
A path in an edge-colored graph is called a rainbow path if every two distinct edges of the path have different colors. A graph whose every pair of vertices are linked by a rainbow…