Properly colored notions of connectivity - a dynamic survey
Xueliang Li, Colton Magnant · Theory and Applications of Graphs · 2015
A path in an edge-colored graph is properly colored if no two consecutive edges receive the same color. In this survey, we gather results concerning notions of graph connectivity involving properly colored paths.