Properly Colored Notions of Connectivity - A Dynamic Survey
oleh: Xueliang Li, Colton Magnant
| Format: | Article |
|---|---|
| Diterbitkan: | Georgia Southern University 2015-01-01 |
Deskripsi
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.