Collapse of the metric hierarchy for bipartite graphs

DOI10.1016/S0195-6698(86)80008-7zbMath0619.05042MaRDI QIDQ1089359

B. George

Publication date: 1986

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

bipartite graphsisometrically embeddable

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph theory (05C99)

Related Items (14)

Separation of two convex sets in convexity structures ⋮ Metric extensions and the \(L^ 1\) hierarchy ⋮ Hypercubes are determined by their distance spectra ⋮ Application of cut polyhedra. I ⋮ Metric Transforms and Euclidean Embeddings ⋮ Clin d'oeil on \(L_1\)-embeddable planar graphs ⋮ Lattice Points of Cut Cones ⋮ Isometric embeddings of subdivided wheels in hypercubes ⋮ Cubic inflation, mirror graphs, regular maps, and partial cubes ⋮ Graphs with intrinsic s3 convexities ⋮ Partial cubes: Structures, characterizations, and constructions ⋮ Subdivided graphs as isometric subgraphs of Hamming graphs ⋮ Characterization of 2-arc-transitive partial cubes ⋮ \(\ell_ 1\)-rigid graphs

Cites Work

• Distance-preserving subgraphs of hypercubes
• On Isometric Embeddings of Graphs
• Hypermetric Spaces and the Hamming Cone
• On the Addressing Problem for Loop Switching
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Collapse of the metric hierarchy for bipartite graphs