Skip to main content
Directed Proper Connection of Graphs
Matematički Vesnik
  • Colton Magnant, Georgia Southern University
  • Patrick R Morley, Georgia Southern University
  • Sarabeth A Porter, Georgia Southern University
  • Pouria Salehi Nowbandegani, Vanderbilt University
  • Hua Wang, Georgia Southern University
Document Type
Publication Date

An edge-colored directed graph is called properly connected if, between every pair of vertices, there is a properly colored directed path. We study some conditions on directed graphs which guarantee the existence of a coloring that is properly connected. We also study conditions on a colored directed graph which guarantee that the coloring is properly connected.


Matematički Vesnik is a fully open access journal. All published articles are made freely and permanently accessible online immediately upon publication, without subscription charges or registration barriers.

Citation Information
Colton Magnant, Patrick R Morley, Sarabeth A Porter, Pouria Salehi Nowbandegani, et al.. "Directed Proper Connection of Graphs" Matematički Vesnik Vol. 68 Iss. 1 (2016) p. 58 - 65 ISSN: 2406-0682
Available at: