The algebra of metric betweenness I: Subdirect representation and retraction

Authors:
Hans-Jürgen Bandelt;Victor Chepoi
Affiliations:
Fachbereich Mathematik, Universität Hamburg, Bundesstr. 55, D-20146 Hamburg, Germany;Laboratoire d'Informatique Fondamentale, Faculté des Sciences de Luminy, Université de la Méditerranée, F-13288 Marseille Cedex 9, France
Venue:
European Journal of Combinatorics
Year:
2007

Citing 20
Cited 1

Pseudo-modular graphs

Discrete Mathematics
On local convexity in graphs

Discrete Mathematics
Dismantling absolute retracts of reflexive graphs

European Journal of Combinatorics
The retracts of Hamming graphs

Discrete Mathematics
Prefibers and the cartesian product of metric spaces

Discrete Mathematics - Algebraic graph theory; a volume dedicated to Gert Sabidussi
Product graph representations

Journal of Graph Theory
Quasi-median graphs and algebras

Journal of Graph Theory
A Helly theorem in weakly modular space

Discrete Mathematics
Bridged graphs are cop-win graphs: an algorithmic proof

Journal of Combinatorial Theory Series B
Retracts of infinite hamming graphs

Journal of Combinatorial Theory Series B
A fixed box theorem for the cartesian product of graphs and metric spaces

Discrete Mathematics
Regular Article: Graphs of Some CAT(0) Complexes

Advances in Applied Mathematics
Dualizability and graph algebras

Discrete Mathematics
Decomposition and l1-embedding of weakly median graphs

European Journal of Combinatorics
On constructible graphs, infinite bridged graphs and weakly cop-win graphs

Discrete Mathematics
Fiber-complemented graphs — I: structure and invariant subgraphs

Discrete Mathematics
On the natural imprint function of a graph

European Journal of Combinatorics
Stable Networks and Product Graphs

Stable Networks and Product Graphs
Word Processing in Groups

Word Processing in Groups
Fiber-complemented graphs II. Retractions and endomorphisms

Discrete Mathematics

The algebra of metric betweenness II: Geometry and equational characterization of weakly median graphs

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We bring together algebraic concepts such as equational class and various concepts from graph theory for developing a structure theory for graphs that promotes a deeper analysis of their metric properties. The basic operators are Cartesian multiplication and gated amalgamation or, alternatively, retraction. Specifically, finite weakly median graphs are known to be decomposable (relative to these operators) into smaller pieces that in turn are parts of hyperoctahedra, the pentagonal pyramid, or of certain triangulations of the plane. This decomposition scheme can be interpreted as Birkhoff's subdirect representation in purely algebraic terms.