Properly Colored Paths and CyclesDiscrete Applied Mathematics
AbstractIn 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.
Citation InformationShinya Fujita and Colton Magnant. "Properly Colored Paths and Cycles" Discrete Applied Mathematics Vol. 159 Iss. 14 (2011) p. 1391 - 1397
Available at: http://works.bepress.com/colton_magnant/20/