Properly Colored Notions of Connectivity - A Dynamic Survey

Authors

Xueliang Li, Nankai UniversityFollow
Colton Magnant, Georgia Southern UniversityFollow

Publication Date

2015

Revision Date

2016

Abstract

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.

Recommended Citation

Li, Xueliang and Magnant, Colton (2015) "Properly Colored Notions of Connectivity - A Dynamic Survey," Theory and Applications of Graphs: Vol. 0: Iss. 1, Article 2.
DOI: 10.20429/tag.2015.000102
Available at: https://digitalcommons.georgiasouthern.edu/tag/vol0/iss1/2