Properly Colored Notions of Connectivity - A Dynamic Survey

By Xueliang Li, Colton Magnant. 2015

90 citations recorded by the source corpus.

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.

Subfields: Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/3efccf8d47f74114d680b7835247f2b0ec6091bd