1 citations · 1 across the 4 of their papers we have counts for
5 papers
Hierarchical and Modularly-Minimal Vertex Colorings
Dulce I. Valdivia, Manuela Geiß, Maribel Hernández Rosales +2
Cographs are exactly the hereditarily well-colored graphs, i.e., the graphs for which a greedy vertex coloring of every induced subgraph uses only the minimally necessary number of…
Hierarchical Colorings of Cographs
D. I. Valdivia, M. Geiß, M. Hellmuth +2
Cographs are exactly hereditarily well-colored graphs, i.e., the graphs for which a greedy coloring of every induced subgraph uses only the minimally necessary number of colors $χ(…
From event labeled gene trees to species trees
Maribel Hernandez-Rosales, Marc Hellmuth, Nicolas Wieseke +3
Background: Tree reconciliation problems have long been studied in phylogenetics. A particular variant of the reconciliation problem for a gene tree T and a species tree S assumes…
Inference of Phylogenetic Trees from the Knowledge of Rare Evolutionary Events
Marc Hellmuth, Maribel Hernandez-Rosales, Yangjing Long +1
Rare events have played an increasing role in molecular phylogenetics as potentially homoplasy-poor characters.In this contribution we analyze the phylogenetic information content…
Spiders can be recognized by counting their legs
Sarah Berkemer, Ricardo Chaves, Adrian Fritz +3
Spiders are arthropods that can be distinguished from their closest relatives, the insects, by counting their legs. Spiders have 8, insects just 6. Spider graphs are a very restric…