32 citations to 10.1016/S0166-218X(97)00066-8 (Crossref Cited-By Service)
  1. Roland Glantz, Henning Meyerhenke, “On finding convex cuts in general, bipartite and plane graphs”, Theoretical Computer Science, 695, 2017, 54  crossref
  2. Sandi Klavžar, “On the canonical metric representation, average distance, and partial Hamming graphs”, European Journal of Combinatorics, 27, № 1, 2006, 68  crossref
  3. Sandi Klavžar, Ivan Gutman, “A theorem on Wiener-type invariants for isometric subgraphs of hypercubes”, Applied Mathematics Letters, 19, № 10, 2006, 1129  crossref
  4. Guangfu Wang, Zhikun Xiong, Lijun Chen, “$l_{1}$-embeddability of shifted quadrilateral cylinder graphs”, Graphs and Combinatorics, 39, № 6, 2023, 129  crossref
  5. Victor Chepoi, Feodor F. Dragan, Yann Vaxès, “Distance and routing labeling schemes for non-positively curved plane graphs”, Journal of Algorithms, 61, № 2, 2006, 60  crossref
  6. Antoine Deza, Michel Deza, Viatcheslav Grishukhin, “Fullerenes and coordination polyhedra versus half-cube embeddings”, Discrete Mathematics, 192, № 1-3, 1998, 41  crossref
  7. Мишель-Мари Деза, M Deza, Михаил Иванович Штогрин, Mikhail Ivanovich Shtogrin, “Мозаики и их изометрические вложения”, Изв. РАН. Сер. матем., 66, № 3, 2002, 3  crossref
  8. Norie Fu, Akihiro Hashikura, Hiroshi Imai, 2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering, 2011, 150  crossref
  9. Michel Deza, Mikhail Shtogrin, “Clusters of cycles”, Journal of Geometry and Physics, 40, № 3-4, 2002, 302  crossref
  10. Guangfu Wang, Heping Zhang, “l1-embeddability under the edge-gluing operation on graphs”, Discrete Mathematics, 313, № 20, 2013, 2115  crossref
Предыдущая
1
2
3
4
Следующая