Distance labeling schemes for K₄-free bridged graphs
From MaRDI portal
Publication:2105446
Recommendations
Cites work
- A Construction of Locally Homogeneous Graphs
- A Helly theorem in weakly modular space
- Algorithms and Computation
- Boundaries of systolic groups.
- Bridged graphs are cop-win graphs: An algorithmic proof
- Compact oracles for reachability and approximate distances in planar digraphs
- Conditions for invariance of set diameters under d-convexification in a graph
- Decomposition and \(l_1\)-embedding of weakly median graphs
- Dismantlability of weakly systolic complexes and applications
- Distance and routing labeling schemes for cube-free median graphs
- Distance and routing labeling schemes for non-positively curved plane graphs
- Distance labeling in graphs
- Distance labeling scheme and split decomposition
- Distributed Computing: A Locality-Sensitive Approach
- Filling invariants of systolic complexes and groups.
- Graph Theory and Probability
- Graphs of some CAT(0) complexes
- scientific article; zbMATH DE number 4031953 (Why is no real title available?)
- scientific article; zbMATH DE number 26592 (Why is no real title available?)
- scientific article; zbMATH DE number 1875437 (Why is no real title available?)
- scientific article; zbMATH DE number 2119682 (Why is no real title available?)
- Isometries of systolic spaces
- Large-type Artin groups are systolic
- Localized and compact data-structure for comparability graphs
- Median problem in some plane triangulations and quadrangulations.
- Medians in median graphs and their cube complexes in linear time
- Metric graph theory and geometry: a survey
- Metric systolicity and two-dimensional Artin groups
- On bridged graphs and cop-win graphs
- On infinite bridged graphs and strongly dismantlable graphs
- On isometric subgraphs of infinite bridged graphs and geodesic convexity
- On local convexity in graphs
- Optimal Distance Labeling for Interval Graphs and Related Graph Families
- Optimal distance labeling schemes for trees
- Query efficient implementation of graphs of bounded clique-width
- Simplicial nonpositive curvature
- Small cancellation theory and automatic groups
- The algebra of metric betweenness. II: Geometry and equational characterization of weakly median graphs
- The fixed point theorem for simplicial nonpositive curvature
- Two-dimensional systolic complexes satisfy property A
- Weakly Modular Graphs and Nonpositive Curvature
Cited in
(4)- Distance constrained labelings of \(K_{4}\)-minor free graphs
- Distance Constrained Labelings of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>K</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:math>-minor Free Graphs
- Distance labeling schemes for cube-free median graphs
- Distance Labeling Schemes for $$K_4$$-Free Bridged Graphs
This page was built for publication: Distance labeling schemes for \(K_4\)-free bridged graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2105446)