Properly Colored Paths and Cycles

Authors

Shinya Fujita, Maebashi Institute of TechnologyFollow
Colton Magnant, Georgia Southern UniversityFollow

Document Type

Article

Publication Date

8-28-2011

Publication Title

Discrete Applied Mathematics

DOI

10.1016/j.dam.2011.06.005

ISSN

0166-218X

Abstract

In an edge-colored graph, let d^c(v) be the number of colors on the edges incident to v and let δ^c(G) be the minimum d^c(v) over all vertices v∈G. In this work, we consider sharp conditions on δ^c(G) which imply the existence of properly edge-colored paths and cycles, meaning no two consecutive edges have the same color.

Recommended Citation

Fujita, Shinya, Colton Magnant. 2011. "Properly Colored Paths and Cycles." Discrete Applied Mathematics, 159 (14): 1391-1397. doi: 10.1016/j.dam.2011.06.005
https://digitalcommons.georgiasouthern.edu/math-sci-facpubs/114