Quasi‐median graphs and algebras
From MaRDI portal
Publication:4312246
DOI10.1002/jgt.3190180705zbMath0810.05057OpenAlexW2107423338MaRDI QIDQ4312246
Hans-Jürgen Bandelt, Elke Wilkeit, Henry Martyn Mulder
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
connected graphfinitary algebrasternary algebrasquasi-median graphmedian structuresquasi-median algebra
Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Graph theory (05C99) Operations and polynomials in algebraic structures, primal algebras (08A40) Finitary algebras (08A62)
Related Items
Quasi-median graphs from sets of partitions, Recognizing Hamming graphs in linear time and space, Axiomatic characterization of the median function of a block graph, Unnamed Item, The algebra of metric betweenness. I: Subdirect representation and retraction, Tiled partial cubes, On the natural imprint function of a graph, Computing median and antimedian sets in median graphs, Clique-gated graphs, Generalized Hamming graphs: some new results, Fast recognition of classes of almost-median graphs, Quasi-isometrically rigid subgroups in right-angled Coxeter groups, Cartesian products of block graphs, Characterizing almost-median graphs, Hamming polynomials and their partial derivatives, Invariant Hamming graphs in infinite quasi-median graphs, Guides and shortcuts in graphs, Retracts of infinite Hamming graphs, Bucolic complexes, Special cube complexes revisited: a quasi-median generalization, Quasi-median graphs, their generalizations, and tree-like equalities, Graphs with \(G^p\)-connected medians, The median function of a block graph: axiomatic characterizations, The algebra of metric betweenness. II: Geometry and equational characterization of weakly median graphs, First-order logic axiomatization of metric graph theory, Planar median graphs and cubesquare-graphs, Fast recognition algorithms for classes of partial cubes, Tree-like partial Hamming graphs, Computing the blocks of a quasi-median graph, Bipartite diametrical graphs of diameter 4 and extreme orders, Hosoya polynomials under gated amalgamations, Measuring closeness of graphs -- the Hausdorff distance, Retracts of Products of Chordal Graphs, Acylindrical hyperbolicity of groups acting on quasi-median graphs and equations in graph products, Embeddings into Thompson's groups from quasi-median geometry, Crossing graphs of fiber-complemented graphs, Quasi-median hulls in Hamming space are Steiner hulls, Fully gated graphs: Recognition and convex operations, Weakly Modular Graphs and Nonpositive Curvature, Crossing graphs of fiber-complemented graphs, Cage-amalgamation graphs, a common generalization of chordal and median graphs, Netlike partial cubes III. The median cycle property, Graphs S(n, k) and a Variant of the Tower of Hanoi Problem, Distance monotonicity and a new characterization of Hamming graphs, Decomposition and \(l_1\)-embedding of weakly median graphs, What Do Trees and Hypercubes Have in Common?
Cites Work
