4 citations · 5 across the 8 of their papers we have counts for
4 papers · 1 filter
Characterizing Block Graphs in Terms of their Vertex-Induced Partitions
A. Dress, K. T. Huber, J. Koolen +2
Given a finite connected simple graph with vertex set and edge set , we will show that the (necessarily unique) smallest block graph wit…
A matroid associated with a phylogenetic tree
Andreas Dress, Katharina Huber, Mike Steel
A (pseudo-)metric on a finite set is said to be a `tree metric' if there is a finite tree with leaf set and non-negative edge weights so that, for all , $D(x…
Blocks and Cut Vertices of the Buneman Graph
A. W. W. Dress, K. T. Huber, J. Koolen +1
Given a set $\Sg$ of bipartitions of some finite set of cardinality at least 2, one can associate to $\Sg$ a canonical -labeled graph $\B(\Sg)$, called the Buneman graph. Th…
A Hall-type theorem for triplet set systems based on medians in trees
Andreas Dress, Mike Steel
Given a collection $\C$ of subsets of a finite set , let $\bigcup \C = \cup_{S \in \C}S$. Philip Hall's celebrated theorem \cite{hall} concerning `systems of distinct representa…