On the number of vertices and edges of the Buneman graph

DOI10.1007/BF02558484MaRDI QIDQ1293464zbMATH OpenOpenAlexWikidataFDO

Authors M. D. Hendy, Andreas W. M. Dress, Katharina T. Huber, Vincent Moulton

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

zbMATH Keywords

Buneman graphcompatibility of taxonomic charactersconnected median graphhypercubesphylogenetic networksphylogenic treessplit decompositionsplit systems

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(22)

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

Describes a project that uses

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)