Properly Colored Notions of Connectivity - A Dynamic SurveyTheory and Applications of Graphs
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 LicenseCreative Commons Attribution 4.0
Citation InformationXueliang Li and Colton Magnant. "Properly Colored Notions of Connectivity - A Dynamic Survey" (2015)
Available at: http://works.bepress.com/colton_magnant/49/