Clin d'oeil on \(L_1\)-embeddable planar graphs

DOI10.1016/S0166-218X(97)00066-8zbMath0892.05018OpenAlexW2169431615WikidataQ56553470 ScholiaQ56553470MaRDI QIDQ1377613

Victor Chepoi, Viatcheslav Grishukhin, Michel Marie Deza

Publication date: 27 July 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

hypercubeembeddingplanar graphsWiener indexisometrically embeddablehalf-cubes

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items

On Wiener numbers of polygonal nets, A theorem on Wiener-type invariants for isometric subgraphs of hypercubes, 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, \(l_1\)-embeddability under the edge-gluing operation on graphs, Isometric embeddings of subdivided wheels in hypercubes, \(l_1\)-embeddability of shifted quadrilateral cylinder graphs, Embeddings of chemical graphs in hypercubes, Subdivided graphs as isometric subgraphs of Hamming graphs, \(l_1\)-embeddability of generic quadrilateral Möbius maps, Uniform partitions of 3-space, their relatives and embedding, Fullerenes and coordination polyhedra versus half-cube embeddings, Complementary \(l_1\)-graphs, General transmission lemma and Wiener complexity of triangular grids, On the canonical metric representation, average distance, and partial Hamming graphs, Clusters of cycles

Cites Work

• Geometry: The unity of theory and practice
• Collapse of the metric hierarchy for bipartite graphs
• On scale embeddings of graphs into hypercubes
• \(\ell_ 1\)-rigid graphs
• Applications of cut polyhedra. II
• Five cycle double covers of some cubic graphs
• A note on \(l_ 1\)-rigid planar graphs
• Recognition of the \(\ell_ 1\)-graphs with complexity \(O(nm)\), or Football in a hypercube
• Distance-preserving subgraphs of hypercubes
• Espaces Métriques Plongeables Dans Un Hypercube: Aspects Combinatoires
• HYPERMETRIC GRAPHS
• Isometric embeddings of semiregular polyhedra, tilings and their duals in hypercubes and cubic lattices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item