Color degree sum conditions for properly colored spanning trees in edge-colored graphs

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 vertical bar G vertical bar, 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. (C) 2020 Elsevier B.V. All rights reserved.