Decomposition and l₁-embedding of weakly median graphs
From MaRDI portal
Publication:1582477
DOI10.1006/EUJC.1999.0377zbMATH Open0965.05081OpenAlexW2122051188MaRDI QIDQ1582477FDOQ1582477
Authors: Hans-Jürgen Bandelt, Victor Chepoi 
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
Recommendations
- scientific article; zbMATH DE number 5626049
- On geodesic structures of weakly median graphs. I. Decomposition and octahedral graphs
- Pseudo-median graphs: Decomposition via amalgamation and Cartesian multiplication
- A poset-based approach to embedding median graphs in hypercubes and lattices
- A decomposition approach for the \(p\)-median problem on disconnected graphs
- Simultaneous embeddings of graphs as median and antimedian subgraphs
- On strongly almost trivial embeddings of graphs
- The decomposition method for the \(p\)-median problem on a disconnected graph
- Embedding graphs as isometric medians
- A Recursive Embedding Approach to Median Graph Computation
Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- On local convexity in graphs
- On bridged graphs and cop-win graphs
- A canonical decomposition theory for metrics on a finite set
- Bridged graphs are cop-win graphs: An algorithmic proof
- Title not available (Why is that?)
- Geometry of cuts and metrics
- Distance-preserving subgraphs of hypercubes
- Median Algebra
- The retracts of Hamming graphs
- Title not available (Why is that?)
- Quasi‐median graphs and algebras
- A dynamic location problem for graphs
- On scale embeddings of graphs into hypercubes
- Dismantling absolute retracts of reflexive graphs
- \(\ell_ 1\)-rigid graphs
- Espaces Métriques Plongeables Dans Un Hypercube: Aspects Combinatoires
- Conditions for invariance of set diameters under d-convexification in a graph
- Title not available (Why is that?)
- Matching binary convexities
- Gated sets in metric spaces
- Title not available (Why is that?)
- Pseudo-median graphs: Decomposition via amalgamation and Cartesian multiplication
- Separation of two convex sets in convexity structures
- Cellular bipartite graphs
- Connected cutsets of a graph and triangle bases of the cycle space
- Title not available (Why is that?)
- On the null-homotopy of bridged graphs
- Title not available (Why is that?)
Cited In (27)
- Bucolic complexes
- On the natural imprint function of a graph
- On covering bridged plane triangulations with balls
- Dismantlability of weakly systolic complexes and applications
- Cage-amalgamation graphs, a common generalization of chordal and median graphs
- Pseudo-median graphs: Decomposition via amalgamation and Cartesian multiplication
- On geodesic structures of weakly median graphs. I. Decomposition and octahedral graphs
- Distance-preserving subgraphs of Johnson graphs
- Median problem in some plane triangulations and quadrangulations.
- On geodesic structures of weakly median graphs. II: Compactness, the role of isometric rays
- Retracts of products of chordal graphs
- The algebra of metric betweenness. I: Subdirect representation and retraction
- The algebra of metric betweenness. II: Geometry and equational characterization of weakly median graphs
- Cycle transit function and betweenness
- \(l_1\)-embeddability of shifted quadrilateral cylinder graphs
- Crossing graphs of fiber-complemented graphs
- First-order logic axiomatization of metric graph theory
- Weakly Modular Graphs and Nonpositive Curvature
- Crossing graphs of fiber-complemented graphs
- Tiled partial cubes
- \(l_1\)-embeddability of generic quadrilateral Möbius maps
- Interval routing in some planar networks.
- Quasi-median graphs, their generalizations, and tree-like equalities
- Hosoya polynomials under gated amalgamations
- Graphs with \(G^p\)-connected medians
- Distance labeling schemes for \(K_4\)-free bridged graphs
- \(l_1\)-embeddability under the edge-gluing operation on graphs
This page was built for publication: Decomposition and \(l_1\)-embedding of weakly median graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1582477)
