Properly Colored Notions of Connectivity - A Dynamic Survey

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.

Keywords

• proper coloring
• connectivity
• proper connection number