38 citations · 173 across the 47 of their papers we have counts for
1 paper · 2 filters
Gregory Gutin, Mark Jones, Bin Sheng +2
A walk W in edge-colored graphs is called properly colored (PC) if every pair of consecutive edges in W is of different color. We introduce and study five types of PC acyclicit…