On scale embeddings of graphs into hypercubes
From MaRDI portal
Publication:1209728
DOI10.1006/eujc.1993.1016zbMath0773.05044OpenAlexW2066006464MaRDI QIDQ1209728
Publication date: 16 May 1993
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/eujc.1993.1016
Related Items (24)
Application of cut polyhedra. I ⋮ Recognizing halved cubes in a constant time per edge ⋮ Vertex cut method for degree and distance-based topological indices and its applications to silicate networks ⋮ On finding convex cuts in general, bipartite and plane graphs ⋮ Clin d'oeil on \(L_1\)-embeddable planar graphs ⋮ Lattice Points of Cut Cones ⋮ \(l_1\)-embeddability under the edge-gluing operation on graphs ⋮ \(l_1\)-embeddability of shifted quadrilateral cylinder graphs ⋮ First-order logic axiomatization of metric graph theory ⋮ Isometric Hamming embeddings of weighted graphs ⋮ Friendship-Like Graphs and It’s Classiffication ⋮ Distance-preserving subgraphs of Johnson graphs ⋮ Embeddability of open-ended carbon nanotubes in hypercubes ⋮ Weakly Modular Graphs and Nonpositive Curvature ⋮ Subdivided graphs as isometric subgraphs of Hamming graphs ⋮ Polyhexes that are \(\ell _1\) graphs ⋮ On density of subgraphs of halved cubes ⋮ \(l_1\)-embeddability of generic quadrilateral Möbius maps ⋮ Decomposition and \(l_1\)-embedding of weakly median graphs ⋮ Uniform partitions of 3-space, their relatives and embedding ⋮ Fullerenes and coordination polyhedra versus half-cube embeddings ⋮ Complementary \(l_1\)-graphs ⋮ On the canonical metric representation, average distance, and partial Hamming graphs ⋮ \(\ell_ 1\)-rigid graphs
This page was built for publication: On scale embeddings of graphs into hypercubes
