Abstract
Given a graph and an edge coloring C of G, a heterochromatic cycle of G is a cycle in which any pair of edges have distinct colors. Let dc(v), named the color degree of a vertex v, be the maximum number of distinct colored edges incident with v. In this paper, we give several sufficient conditions for the existence of heterochromatic cycles in edge-colored graphs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
