Decomposition and \(l_1\)-embedding of weakly median graphs
From MaRDI portal
Publication:1582477
DOI10.1006/eujc.1999.0377zbMath0965.05081OpenAlexW2122051188MaRDI QIDQ1582477
Victor Chepoi, Hans-Jürgen Bandelt
Publication date: 2 August 2001
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/eujc.1999.0377
Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (26)
The algebra of metric betweenness. I: Subdirect representation and retraction ⋮ Tiled partial cubes ⋮ On the natural imprint function of a graph ⋮ \(l_1\)-embeddability under the edge-gluing operation on graphs ⋮ Bucolic complexes ⋮ Quasi-median graphs, their generalizations, and tree-like equalities ⋮ Graphs with \(G^p\)-connected medians ⋮ Interval routing in some planar networks. ⋮ The algebra of metric betweenness. II: Geometry and equational characterization of weakly median graphs ⋮ \(l_1\)-embeddability of shifted quadrilateral cylinder graphs ⋮ First-order logic axiomatization of metric graph theory ⋮ Unnamed Item ⋮ Median problem in some plane triangulations and quadrangulations. ⋮ Distance-preserving subgraphs of Johnson graphs ⋮ Hosoya polynomials under gated amalgamations ⋮ Retracts of Products of Chordal Graphs ⋮ On geodesic structures of weakly median graphs. I. Decomposition and octahedral graphs ⋮ On geodesic structures of weakly median graphs. II: Compactness, the role of isometric rays ⋮ Crossing graphs of fiber-complemented graphs ⋮ On covering bridged plane triangulations with balls ⋮ Weakly Modular Graphs and Nonpositive Curvature ⋮ Crossing graphs of fiber-complemented graphs ⋮ Cage-amalgamation graphs, a common generalization of chordal and median graphs ⋮ \(l_1\)-embeddability of generic quadrilateral Möbius maps ⋮ Dismantlability of weakly systolic complexes and applications ⋮ Distance labeling schemes for \(K_4\)-free bridged graphs
Cites Work
- A dynamic location problem for graphs
- Matching binary convexities
- Gated sets in metric spaces
- Connected cutsets of a graph and triangle bases of the cycle space
- On local convexity in graphs
- On the null-homotopy of bridged graphs
- On bridged graphs and cop-win graphs
- Dismantling absolute retracts of reflexive graphs
- Pseudo-median graphs: Decomposition via amalgamation and Cartesian multiplication
- A canonical decomposition theory for metrics on a finite set
- The retracts of Hamming graphs
- On scale embeddings of graphs into hypercubes
- \(\ell_ 1\)-rigid graphs
- Separation of two convex sets in convexity structures
- Bridged graphs are cop-win graphs: An algorithmic proof
- Cellular bipartite graphs
- Distance-preserving subgraphs of hypercubes
- Conditions for invariance of set diameters under d-convexification in a graph
- Median Algebra
- Espaces Métriques Plongeables Dans Un Hypercube: Aspects Combinatoires
- Quasi‐median graphs and algebras
- Geometry of cuts and metrics
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Decomposition and \(l_1\)-embedding of weakly median graphs
