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.
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.
Li, Xueliang and Magnant, Colton
"Properly Colored Notions of Connectivity - A Dynamic Survey,"
Theory and Applications of Graphs: Vol. 0
, Article 2.
Available at: https://digitalcommons.georgiasouthern.edu/tag/vol0/iss1/2