From copair hypergraphs to median graphs with latent vertices

DOI10.1016/0012-365X(89)90283-5zbMath0732.05042WikidataQ60962145 ScholiaQ60962145MaRDI QIDQ809099

Jean-Pierre Barthelemy

Publication date: 1989

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

median graphsHasse diagramsBuneman constructioncopair hypergraphpartially labelled trees

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (05C99)

Related Items

Quasi-median graphs from sets of partitions, Replacing cliques by stars in quasi-median graphs, On the use of ordered sets in problems of comparison and consensus of classifications, Unnamed Item, Uprooted phylogenetic networks, Injective split systems, On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes, Convex tree realizations of partitions, An explicit computation of the injective hull of certain finite metric spaces in terms of their associated Buneman complex, A polynomial time algorithm for constructing the refined Buneman tree, Median graphs and tree analysis of dichotomous data, an approach to qualitative factor analysis, A comparison between two distinct continuous models in projective cluster theory: The median and the tight-span construction, On the number of vertices and edges of the Buneman graph, Some variations on a theme by Buneman, What Do Trees and Hypercubes Have in Common?

Cites Work

• Unnamed Item
• Unnamed Item
• Median graphs and Helly hypergraphs
• Median algebras
• Metric Ternary Distributive Semi-Lattices
• Discrete Ordered Sets whose Covering Graphs are Median
• n‐cubes and median graphs
• A ternary operation in distributive lattices