Title

Properly Colored Paths and Cycles

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 dc(v) be the number of colors on the edges incident to v and let δc(G) be the minimum dc(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.

Share

COinS