On Isometric Embeddings of Graphs
From MaRDI portal
Publication:3697031
DOI10.2307/1999951zbMath0576.05017OpenAlexW4234417420MaRDI QIDQ3697031
Peter M. Winkler, Ronald L. Graham
Publication date: 1985
Full work available at URL: https://doi.org/10.2307/1999951
Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items
Minimum dimension embedding of finite metric spaces, Cut method and Djoković-Winkler's relation, Metric extensions and the \(L^ 1\) hierarchy, Hypercubes are determined by their distance spectra, Collapse of the metric hierarchy for bipartite graphs, Addressing the Petersen graph, The algebra of metric betweenness. I: Subdirect representation and retraction, Isometric embeddings into cube-hypergraphs, Application of cut polyhedra. I, On the natural imprint function of a graph, The geometry of graphs and some of its algorithmic applications, Recognizing Cartesian graph bundles, Characterization of products of trees and grids, Recognizing halved cubes in a constant time per edge, A problem on distance matrices of subsets of the Hamming cube, Isometric embeddings in Hamming graphs, Metric Transforms and Euclidean Embeddings, The Graovac-Pisanski index of zig-zag tubulenes and the generalized cut method, A characterization of cube-hypergraphs, Finite metric spaces of strictly negative type, Wiener number of vertex-weighted graphs and a chemical application, Factoring cartesian‐product graphs, Retracts of infinite Hamming graphs, Quadratic embedding constants of graph joins, On the metric representation of the vertices of a graph, Quadratic embedding constants of graphs: bounds and distance spectra, On a symmetric representation of Hermitian matrices and its applications to graph theory, Quasi-median graphs, their generalizations, and tree-like equalities, Grassmannians of codes, Factorization and pseudofactorization of weighted graphs, Partition distance in graphs, Ramified rectilinear polygons: coordinatization by dendrons, Isometric Hamming embeddings of weighted graphs, Wiener index in weighted graphs via unification of \(\varTheta^\ast\)-classes, Tree-like partial Hamming graphs, Representations of graphs and networks (coding, layouts and embeddings), On the Structure of Isometrically Embeddable Metric Spaces, Partial cubes are distance graphs, A survey and classification of Sierpiński-type graphs, Computing equivalence classes among the edges of a graph with applications, A note on Winkler's algorithm for factoring a connected graph, A new fixed point approach for stable networks and stable marriages, Distance spectra of graphs: a survey, Partial star products: a local covering approach for the recognition of approximate Cartesian product graphs, Cartesian graph factorization at logarithmic cost per edge, On induced and isometric embeddings of graphs into the strong product of paths, Distance matrices of subsets of the Hamming cube, Factoring a graph in polynomial time, A dynamic location problem for graphs, Strong products of \(\chi\)-critical graphs, Weakly Modular Graphs and Nonpositive Curvature, Isometric subgraphs of Hamming graphs and d-convexity, Unnamed Item, A poset-based approach to embedding median graphs in hypercubes and lattices, On subgraphs of Cartesian product graphs and S-primeness, Induced Embeddings into Hamming Graphs., An Euler-type formula for median graphs, Factoring cardinal product graphs in polynomial time, Distances in benzenoid systems: Further developments, The semigroup of metric measure spaces and its infinitely divisible probability measures, Characterizing flag graphs and incuced subgraphs of Cartesian product graphs, On the canonical metric representation, average distance, and partial Hamming graphs, Distance geometry for kissing spheres, A polynomial time algorithm for finding the prime factors of Cartesian- product graphs, On approximating planar metrics by tree metrics., \(\ell_ 1\)-rigid graphs, Strict refinement for graphs and digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the distance matrix of a tree
- Distance matrix polynomials of trees
- Distance-preserving subgraphs of hypercubes
- Hypermetric Spaces and the Hamming Cone
- Espaces Métriques Plongeables Dans Un Hypercube: Aspects Combinatoires
- Extremal Metrics Induced by Graphs
- On the distance matrix of a directed graph
- On the Loop Switching Addressing Problem
- On the Addressing Problem for Loop Switching
- On the Addressing Problem of Loop Switching
