From copair hypergraphs to median graphs with latent vertices

DOI10.1016/0012-365X(89)90283-5zbMATH Open0732.05042DBLPjournals/dm/Barthelemy89WikidataQ60962145 ScholiaQ60962145MaRDI QIDQ809099FDOQ809099

Authors: J. P. Barthélemy 

Publication date: 1989

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

Recommendations

• scientific article; zbMATH DE number 1339499
• Median graphs, parallelism and posets
• Medians in median graphs
• On graphs containing a given graphs as median
• scientific article; zbMATH DE number 165070

zbMATH Keywords

median graphsHasse diagramsBuneman constructioncopair hypergraphpartially labelled trees

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (05C99)

Cites Work

• Median algebras
• n‐cubes and median graphs
• Title not available (Why is that?)
• Metric Ternary Distributive Semi-Lattices
• A ternary operation in distributive lattices
• Median graphs and Helly hypergraphs
• Title not available (Why is that?)
• Discrete Ordered Sets whose Covering Graphs are Median

Cited In (17)

• Injective split systems
• 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
• Some variations on a theme by Buneman
• Replacing cliques by stars in quasi-median graphs
• A polynomial time algorithm for constructing the refined Buneman tree
• On the use of ordered sets in problems of comparison and consensus of classifications
• On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes
• Convex tree realizations of partitions
• Uprooted phylogenetic networks
• What do trees and hypercubes have in common?
• On the number of vertices and edges of the Buneman graph
• Retracts of hypercubes
• 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
• A comparison of ordinal analysis techniques in medical resource usage research
• Generalizing the hypergraph Laplacian via a diffusion process with mediators

This page was built for publication: From copair hypergraphs to median graphs with latent vertices

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