Directed Proper Connection of Graphs

Colton Magnant; Patrick Ryan Morley; Sarabeth Porter; Pouria Salehi Nowbandegani; Hua Wang

Directed Proper Connection of Graphs

Colton Magnant, Patrick Ryan Morley, Sarabeth Porter, Pouria Salehi Nowbandegani, Hua Wang

Mathematical Sciences

Research output: Contribution to journal › Article › peer-review

20 Scopus citations

Abstract

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.

Original language	American English
Journal	Matematički Vesnik
Volume	68
State	Published - Mar 1 2016

Keywords

Directed Graph
Edge Coloring
Proper Connection

DC Disciplines

Education
Mathematics

Access to Document

Directed Proper Connection of GraphsFinal published version, 230 KBLicense: Unspecified

http://emis.ams.org/journals/MV/161/mv16106.pdf

Cite this

@article{3ec62ce2a16046e484b791d740c74020,

title = "Directed Proper Connection of Graphs",

abstract = "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.",

keywords = "Directed Graph, Edge Coloring, Proper Connection",

author = "Colton Magnant and Morley, {Patrick Ryan} and Sarabeth Porter and Nowbandegani, {Pouria Salehi} and Hua Wang",

year = "2016",

month = mar,

day = "1",

language = "American English",

volume = "68",

journal = "Matemati{\v c}ki Vesnik",

}

TY - JOUR

T1 - Directed Proper Connection of Graphs

AU - Magnant, Colton

AU - Morley, Patrick Ryan

AU - Porter, Sarabeth

AU - Nowbandegani, Pouria Salehi

AU - Wang, Hua

PY - 2016/3/1

Y1 - 2016/3/1

N2 - 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.

AB - 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.

KW - Directed Graph

KW - Edge Coloring

KW - Proper Connection

UR - https://digitalcommons.georgiasouthern.edu/math-sci-facpubs/612

M3 - Article

VL - 68

JO - Matematički Vesnik

JF - Matematički Vesnik

ER -

Directed Proper Connection of Graphs

Abstract

Keywords

DC Disciplines

Access to Document

Other files and links

Fingerprint

Cite this