Properly colored spanning trees in edge-colored graphs

• Published in: Discrete mathematics Vol. 343; no. 1; p. 111629
• Main Authors: Cheng, Yangyang, Kano, Mikio, Wang, Guanghui
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.01.2020
• Subjects: Edge colored graph; Properly colored; Rainbow; Spanning tree; Edge colored graph; Spanning tree; Rainbow; Properly colored

A subgraph H of an edge-colored graph G is called a properly colored subgraph if no two adjacent edges of H have the same color, and is called a rainbow subgraph if no two edges of H have the same color. For a vertex v of G, the color degree of v, denoted by dGc(v), is the number of distinct colors...