Directed proper connection of graphs

Authors

  • Colton Magnant Department of Mathematical Sciences, Georgia Southern University, Statesboro, GA, 30460, U.S.A Author
  • Patrick Ryan Morley Department of Mathematical Sciences, Georgia Southern University, Statesboro, GA, 30460, U.S.A Author
  • Sarabeth Porter Department of Mathematical Sciences, Georgia Southern University, Statesboro, GA, 30460, U.S.A Author
  • Pouria Salehi Nowbandegani Pharmaceutical Research Center, Shiraz University of Medical Sciences, Shiraz, Iran Author
  • Hua Wang Department of Mathematical Sciences, Georgia Southern University, Statesboro, GA, 30460, U.S.A Author

Keywords:

directed graph, edge coloring, proper connection

Subjects:

05C15, 05C20

Abstract

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

Downloads

Published

2016-01-15

Issue

Vol. 68 No. 1 (2016): Vol. 68, Issue 1

Section

Articles

License

Copyright (c) 2016 Authors retain copyright to their work.

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.