On Edge-Colored Graphs Covered by Properly Colored Cycles
Graphs and Combinatorics (Springer),
Special issue in memory of Professor Victor Neumann-Lara,
vol. 21, no. 3, pp. 301-306, 2005.
Download:   [paper ps] [paper pdf]
Abstract:We characterize edge-colored graphs in which every edge belongs to some properly colored cycle.
We obtain our result by applying a characterization of 1-extendable graphs.