On the number of vertices and edges of the Buneman graph
From MaRDI portal
Publication:1293464
DOI10.1007/BF02558484zbMath0927.05077OpenAlexW2003312650WikidataQ60962147 ScholiaQ60962147MaRDI QIDQ1293464
Michael D. Hendy, Katharina T. Huber, Vincent L. Moulton, Andreas W. M. Dress
Publication date: 5 October 1999
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02558484
hypercubesphylogenetic networkssplit decompositionphylogenic treessplit systemsBuneman graphcompatibility of taxonomic charactersconnected median graph
Trees (05C05) Graph theory (05C99) Other combinatorial set theory (03E05) Mathematical biology in general (92B99)
Related Items
Quasi-median graphs from sets of partitions, Replacing cliques by stars in quasi-median graphs, Cell complexes, poset topology and the representation theory of algebras arising in algebraic combinatorics and discrete geometry, Unnamed Item, From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats, Injective split systems, The polytopal structure of the tight-span of a totally split-decomposable metric, On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes, Recovering trees from well-separated multi-state characters., Counting vertices and cubes in median graphs of circular split systems, Hyperconvexity and tight-span theory for diversities, An explicit computation of the injective hull of certain finite metric spaces in terms of their associated Buneman complex, Combinatorics of lopsided sets, From modular decomposition trees to rooted median graphs, A comparison between two distinct continuous models in projective cluster theory: The median and the tight-span construction, Some variations on a theme by Buneman
Uses Software
Cites Work
