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!
0
Published in 2018 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-017-0111-7
Abstract: Tree representations of (sets of) symmetric binary relations, or equivalently edge-colored undirected graphs, are of central interest, e.g. in phylogenomics. In this context symbolic ultrametrics play a crucial role. Symbolic ultrametrics define an edge-colored complete…
read more here.
Keywords:
tree representations;
symbolic ultrametrics;
cograph edge;
topology ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2018 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-017-0238-6
Abstract: The problem of finding the maximum number of vertex-disjoint uni-color paths in an edge-colored graph (called MaxCDP) has been recently introduced in literature, motivated by applications in social network analysis. In this paper we investigate…
read more here.
Keywords:
disjoint paths;
disjoint;
finding disjoint;
problem ... See more keywords
Sign Up to like & get
recommendations!
2
Published in 2021 at "PLoS Computational Biology"
DOI: 10.1371/journal.pcbi.1008990
Abstract: RNA tertiary structure is crucial to its many non-coding molecular functions. RNA architecture is shaped by its secondary structure composed of stems, stacked canonical base pairs, enclosing loops. While stems are precisely captured by free-energy…
read more here.
Keywords:
colored graphs;
base pairs;
recurrent rna;
structure ... See more keywords