Skip to main content
Article
Properly colored notions of connectivity - a dynamic survey
Theory and Applications of Graphs
  • Xueliang Li, Nankai University
  • Colton Magnant, Georgia Southern University
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
Creative Commons Attribution 4.0
Citation Information
Xueliang Li and Colton Magnant. "Properly colored notions of connectivity - a dynamic survey" (2015)
Available at: http://works.bepress.com/colton_magnant/49/