\input zb-basic
\input zb-ioport
\iteman{io-port 05964678}
\itemau{Fujita, Shinya; Magnant, Colton}
\itemti{Properly colored paths and cycles.}
\itemso{Discrete Appl. Math. 159, No. 14, 1391-1397 (2011).}
\itemab
Summary: In an edge-colored graph, let $d^{c}(v)$ be the number of colors on the edges incident to $v$ and let $\delta ^{c}(G)$ be the minimum $d^{c}(v)$ over all vertices $v\in G$. In this work, we consider sharp conditions on $\delta ^{c}(G)$ which imply the existence of properly edge-colored paths and cycles, meaning no two consecutive edges have the same color.
\itemrv{~}
\itemcc{}
\itemut{properly colored cycles; properly colored paths; edge-colored graphs}
\itemli{doi:10.1016/j.dam.2011.06.005}
\end