Document Type and Release Option
Thesis (restricted to Georgia Southern)
An edge-colored directed graph is called properly connected if, between every pair of vertices, there is a properly colored directed path. In this work, we study multiple conditions on directed graphs which guarantee the existence of a coloring that is properly connected. We also evaluate conditions on a colored directed graph which guarantee that the coloring is properly connected.
Porter, Sarabeth A., "Directed Proper Connection of Graphs" (2015). Honors College Theses. 142.