Quasi‐median graphs and algebras

DOI10.1002/jgt.3190180705zbMath0810.05057MaRDI QIDQ4312246

Henry Martyn Mulder, Hans-Jürgen Bandelt, Elke Wilkeit

Publication date: 4 April 1995

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190180705

zbMATH Keywords

connected graph; finitary algebras; ternary algebras; quasi-median graph; median structures; quasi-median algebra

Mathematics Subject Classification ID

05C75: Structural characterization of families of graphs

05C12: Distance in graphs

05C99: Graph theory

08A40: Operations and polynomials in algebraic structures, primal algebras

08A62: Finitary algebras

Related Items

Unnamed Item, Tiled partial cubes, Crossing graphs of fiber-complemented graphs, Crossing graphs of fiber-complemented graphs, Fast recognition of classes of almost-median graphs, Characterizing almost-median graphs, Hamming polynomials and their partial derivatives, Bipartite diametrical graphs of diameter 4 and extreme orders, Hosoya polynomials under gated amalgamations, Quasi-median hulls in Hamming space are Steiner hulls, Cage-amalgamation graphs, a common generalization of chordal and median graphs, Netlike partial cubes III. The median cycle property, Distance monotonicity and a new characterization of Hamming graphs, Invariant Hamming graphs in infinite quasi-median graphs, On the natural imprint function of a graph, Clique-gated graphs, Retracts of infinite Hamming graphs, Quasi-median graphs, their generalizations, and tree-like equalities, Fast recognition algorithms for classes of partial cubes, Decomposition and \(l_1\)-embedding of weakly median graphs, Quasi-median graphs from sets of partitions, Cartesian products of block graphs, The algebra of metric betweenness. I: Subdirect representation and retraction, Computing median and antimedian sets in median graphs, The algebra of metric betweenness. II: Geometry and equational characterization of weakly median graphs, Fully gated graphs: Recognition and convex operations, Graphs S(n, k) and a Variant of the Tower of Hanoi Problem

Cites Work

• A Helly theorem in weakly modular space
• Unnamed Item
• Unnamed Item