Sign Up to like & get
recommendations!
1
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
Sign Up to like & get
recommendations!
1
Published in 2018 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-017-0191-4
Abstract: The proper-trail connection number of a graph is the minimum number of colors needed to color the edges such that every pair of vertices are joined by a trail without two consecutive edges of the…
read more here.
Keywords:
number;
colored trails;
properly colored;
trails paths ... See more keywords