Theory and Applications of Graphs · 2015 · 80 citations · 20 references
Directed GraphGeometric Graph TheoryNetwork ScienceGraph TheoryTopological Graph TheoryEdge-colored GraphDynamic SurveyConsecutive EdgesPlanar GraphNetwork AnalysisEducationDiscrete MathematicsExtremal Graph TheoryNetwork TheoryGraph Connectivity
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.
20
Gary Chartrand, Garry L. Johns, Kathleen A. McKeon et al. · Mathematica Bohemica · 2008 · 564 citations · Full text
Valentin Borozan, Shinya Fujita, Aydin Gerek et al. · Discrete Mathematics · 2011 · 123 citations