Rainbow and Properly Colored Spanning Trees in Edge-Colored Bipartite Graphs
Sign Up to like & getrecommendations! Published in 2021 at "Graphs and Combinatorics"
DOI: 10.1007/s00373-021-02334-5
Abstract: An edge-colored graph is called rainbow (or heterochromatic) if all its edges have distinct colors. It is known that if an edge-colored connected graph H has minimum color degree at least |H|/2 and has a… read more here.
Keywords: color degree; minimum color; colored spanning; properly colored ... See more keywords