On the number of vertices and edges of the Buneman graph

DOI10.1007/BF02558484zbMATH Open0927.05077OpenAlexW2003312650WikidataQ60962147 ScholiaQ60962147MaRDI QIDQ1293464FDOQ1293464

Katharina T. Huber, Vincent Moulton, M. D. Hendy, 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

Recommendations

• Some variations on a theme by Buneman
• Blocks and cut vertices of the Buneman graph
• Counting vertices and cubes in median graphs of circular split systems
• Replacing cliques by stars in quasi-median graphs

zbMATH Keywords

phylogenetic networkshypercubessplit decompositionphylogenic treessplit systemsBuneman graphcompatibility of taxonomic charactersconnected median graph

Mathematics Subject Classification ID

Trees (05C05) Mathematical biology in general (92B99) Other combinatorial set theory (03E05) Graph theory (05C99)

Cites Work

• A canonical decomposition theory for metrics on a finite set
• From copair hypergraphs to median graphs with latent vertices
• Some variations on a theme by Buneman
• Analyzing and visualizing sequence and distance data using SPLITSTREE

Cited In (18)

• The relation graph
• Injective split systems
• Counting vertices and cubes in median graphs of circular split systems
• 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
• Replacing cliques by stars in quasi-median graphs
• On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes
• Combinatorics of lopsided sets
• Hyperconvexity and tight-span theory for diversities
• From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats
• Cell complexes, poset topology and the representation theory of algebras arising in algebraic combinatorics and discrete geometry
• On the number of \(B\)-flows of a graph
• From modular decomposition trees to rooted median graphs
• An explicit computation of the injective hull of certain finite metric spaces in terms of their associated Buneman complex
• Quasi-median graphs from sets of partitions
• Recovering trees from well-separated multi-state characters.
• The polytopal structure of the tight-span of a totally split-decomposable metric
• A comparison of ordinal analysis techniques in medical resource usage research

Uses Software

• SplitsTree

This page was built for publication: On the number of vertices and edges of the Buneman graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1293464)