Collapse of the metric hierarchy for bipartite graphs
From MaRDI portal
DOI10.1016/S0195-6698(86)80008-7zbMATH Open0619.05042MaRDI QIDQ1089359FDOQ1089359
Authors: B. George 
Publication date: 1986
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- On the Addressing Problem for Loop Switching
- Distance-preserving subgraphs of hypercubes
- On Isometric Embeddings of Graphs
- Title not available (Why is that?)
- Hypermetric Spaces and the Hamming Cone
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (16)
- \(\ell_ 1\)-rigid graphs
- Hypercubes are determined by their distance spectra
- Partial cubes: Structures, characterizations, and constructions
- Cubic inflation, mirror graphs, regular maps, and partial cubes
- Application of cut polyhedra. I
- Isometric embeddings of subdivided wheels in hypercubes
- Separation of two convex sets in convexity structures
- Subdivided graphs as isometric subgraphs of Hamming graphs
- Characterization of 2-arc-transitive partial cubes
- Metric extensions and the \(L^ 1\) hierarchy
- Axiomatic characterization of the interval function of partial cubes and partial Hamming graphs
- Clin d'oeil on \(L_1\)-embeddable planar graphs
- Metric Transforms and Euclidean Embeddings
- Graphs with intrinsic s3 convexities
- Title not available (Why is that?)
- Lattice Points of Cut Cones
This page was built for publication: Collapse of the metric hierarchy for bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1089359)
