The following pages link to On Isometric Embeddings of Graphs (Q3697031):
Displaying 50 items.
- Cut method and Djoković-Winkler's relation (Q277477) (← links)
- Hypercubes are determined by their distance spectra (Q290656) (← links)
- A survey and classification of Sierpiński-type graphs (Q516890) (← links)
- Factoring a graph in polynomial time (Q579285) (← links)
- A dynamic location problem for graphs (Q583245) (← links)
- Computing equivalence classes among the edges of a graph with applications (Q686277) (← links)
- A note on Winkler's algorithm for factoring a connected graph (Q686292) (← links)
- A poset-based approach to embedding median graphs in hypercubes and lattices (Q766140) (← links)
- On a symmetric representation of Hermitian matrices and its applications to graph theory (Q896012) (← links)
- Ramified rectilinear polygons: coordinatization by dendrons (Q908206) (← links)
- A polynomial time algorithm for finding the prime factors of Cartesian- product graphs (Q1067411) (← links)
- Strict refinement for graphs and digraphs (Q1072575) (← links)
- Minimum dimension embedding of finite metric spaces (Q1076679) (← links)
- Collapse of the metric hierarchy for bipartite graphs (Q1089359) (← links)
- Isometric embeddings in Hamming graphs (Q1110526) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- A new fixed point approach for stable networks and stable marriages (Q1201153) (← links)
- Cartesian graph factorization at logarithmic cost per edge (Q1210332) (← links)
- \(\ell_ 1\)-rigid graphs (Q1321589) (← links)
- Metric extensions and the \(L^ 1\) hierarchy (Q1332439) (← links)
- Isometric embeddings into cube-hypergraphs (Q1343777) (← links)
- On the natural imprint function of a graph (Q1348742) (← links)
- Recognizing Cartesian graph bundles (Q1356477) (← links)
- Characterization of products of trees and grids (Q1356541) (← links)
- Finite metric spaces of strictly negative type (Q1377510) (← links)
- Wiener number of vertex-weighted graphs and a chemical application (Q1377617) (← links)
- Retracts of infinite Hamming graphs (Q1386474) (← links)
- Quasi-median graphs, their generalizations, and tree-like equalities (Q1399693) (← links)
- An Euler-type formula for median graphs (Q1584314) (← links)
- Factoring cardinal product graphs in polynomial time (Q1584444) (← links)
- Distances in benzenoid systems: Further developments (Q1584454) (← links)
- On approximating planar metrics by tree metrics. (Q1603386) (← links)
- Partition distance in graphs (Q1703394) (← links)
- Strong products of \(\chi\)-critical graphs (Q1801332) (← links)
- On subgraphs of Cartesian product graphs and S-primeness (Q1827726) (← links)
- Addressing the Petersen graph (Q1887643) (← links)
- Application of cut polyhedra. I (Q1891019) (← links)
- The geometry of graphs and some of its algorithmic applications (Q1894703) (← links)
- Recognizing halved cubes in a constant time per edge (Q1902967) (← links)
- A characterization of cube-hypergraphs (Q1917484) (← links)
- Distance matrices of subsets of the Hamming cube (Q2020430) (← links)
- Distance spectra of graphs: a survey (Q2250935) (← links)
- Partial star products: a local covering approach for the recognition of approximate Cartesian product graphs (Q2254071) (← links)
- Distance geometry for kissing spheres (Q2348019) (← links)
- The algebra of metric betweenness. I: Subdirect representation and retraction (Q2372427) (← links)
- The Graovac-Pisanski index of zig-zag tubulenes and the generalized cut method (Q2402932) (← links)
- Wiener index in weighted graphs via unification of \(\varTheta^\ast\)-classes (Q2441614) (← links)
- Tree-like partial Hamming graphs (Q2442273) (← links)
- Partial cubes are distance graphs (Q2470449) (← links)
- On induced and isometric embeddings of graphs into the strong product of paths (Q2497473) (← links)
