Quasi-median graphs from sets of partitions

DOI10.1016/S0166-218X(01)00353-5zbMath0999.05028MaRDI QIDQ1613411

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

Publication date: 29 August 2002

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

zbMATH Keywords

partitionsHamming graphHamming distanceblock graphquasi-median graph

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items (6)

Replacing cliques by stars in quasi-median graphs ⋮ The algebra of metric betweenness. II: Geometry and equational characterization of weakly median graphs ⋮ Visualization of quasi-median networks ⋮ Recovering trees from well-separated multi-state characters. ⋮ Computing the blocks of a quasi-median graph ⋮ Quasi-median hulls in Hamming space are Steiner hulls

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• From copair hypergraphs to median graphs with latent vertices
• Superextensions and the depth of median graphs
• The retracts of Hamming graphs
• Polynomial interpolation and the Chinese remainder theorem for algebraic systems
• On the existence of subalgebras of direct products with prescribed d-fold projections
• 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
• The relation graph
• Trees, taxonomy, and strongly compatible multi-state characters
• The median procedure on median graphs
• Median algebras
• Graphs with intrinsic s3 convexities
• Algebraic properties of Husimi trees
• Algorithms on Strings, Trees and Sequences
• Topics in Intersection Graph Theory
• Triangulating Vertex-Colored Graphs
• Quasi‐median graphs and algebras

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