Quasi-median graphs from sets of partitions

DOI10.1016/S0166-218X(01)00353-5MaRDI QIDQ1613411zbMATH OpenFDO

Authors Hans-Jürgen Bandelt, Katharina T. Huber, Vincent Moulton

Publication date 29 August 2002

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

Full work available at URL https://doi.org/10.1016/S0166-218X(01)00353-5

zbMATH Keywords

block graphHamming distanceHamming graphpartitionsquasi-median graph

Mathematics Subject Classification ID

Distance in graphs (05C12)

Recommendations

• Computing the blocks of a quasi-median graph
• The relation graph
• Replacing cliques by stars in quasi-median graphs
• Quasi-median hulls in Hamming space are Steiner hulls
• Quasi-almostmedian graphs

Cites work

• A comparison between two distinct continuous models in projective cluster theory: The median and the tight-span construction
• Algebraic properties of Husimi trees
• Algorithms on Strings, Trees and Sequences
• From copair hypergraphs to median graphs with latent vertices
• Graphs with intrinsic s3 convexities
• scientific article; zbMATH DE number 439012 (Why is no real title available?)
• scientific article; zbMATH DE number 3613112 (Why is no real title available?)
• scientific article; zbMATH DE number 501493 (Why is no real title available?)
• Median algebras
• On the existence of subalgebras of direct products with prescribed d-fold projections
• On the number of vertices and edges of the Buneman graph
• Polynomial interpolation and the Chinese remainder theorem for algebraic systems
• Quasi‐median graphs and algebras
• Some variations on a theme by Buneman
• Superextensions and the depth of median graphs
• The median procedure on median graphs
• The relation graph
• The retracts of Hamming graphs
• Topics in Intersection Graph Theory
• Trees, taxonomy, and strongly compatible multi-state characters
• Triangulating Vertex-Colored Graphs

Cited in

(9)

• Quasi-median hulls in Hamming space are Steiner hulls
• Pseudo-median graphs: Decomposition via amalgamation and Cartesian multiplication
• The relation graph
• Recovering trees from well-separated multi-state characters.
• Replacing cliques by stars in quasi-median graphs
• The algebra of metric betweenness. II: Geometry and equational characterization of weakly median graphs
• Computing the blocks of a quasi-median graph
• Visualization of quasi-median networks
• Median geometry and applications. Abstracts from the workshop held February 15--20, 2026

This page was built for publication: Quasi-median graphs from sets of partitions

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