ABSTRACT
No abstract available.
Recommendations
Injective Split Systems
AbstractA split system on a finite set X, , is a set of bipartitions or splits of X which contains all splits of the form , . To any such split system we can associate the Buneman graph which is essentially a median graph with ...
Minimal split completions
We study the problem of adding an inclusion minimal set of edges to a given arbitrary graph so that the resulting graph is a split graph, called a minimal split completion of the input graph. Minimal completions of arbitrary graphs into chordal and ...
Constructing and Drawing Regular Planar Split Networks
Split networks are commonly used to visualize collections of bipartitions, also called splits, of a finite set. Such collections arise, for example, in evolutionary studies. Split networks can be viewed as a generalization of phylogenetic trees and may ...
Comments