Abstract
For a vertex v of an edge-colored graph, the color degree of v is the number of colors appeared in edges incident with v. An edge-colored graph is called properly colored if no two adjacent edges have the same color. In this paper, we prove that if the minimum color degree sum of two adjacent vertices of an edge-colored connected graph G is at least |G|, then G has a properly colored spanning tree. This is a generalization of the result proved by Cheng, Kano and Wang. We also show the sharpness of this lower bound of the color degree sum.
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.
