- Michel Deza, Monique Laurent, “Applications of cut polyhedra — I”, Journal of Computational and Applied Mathematics, 55, no. 2, 1994, 191
- Victor Chepoi, Michel Deza, Viatcheslav Grishukhin, “Clin d'oeil on L1-embeddable planar graphs”, Discrete Applied Mathematics, 80, no. 1, 1997, 3
- Guangfu Wang, Chenyang Li, Fengling Wang, “l1-Embeddability Under Gate-Sum Operation of Two l1-Graphs”, Front. Phys., 8, 2020, 146
- Guangfu Wang, Lijun Chen, Zhikun Xiong, “The l1-Embeddability of Hypertrees and Unicyclic Hypergraphs”, Symmetry, 14, no. 11, 2022, 2260
- Wilfried Imrich, Sandi Klavẑar, Aleksander Vesel, “Recognizing halved cubes in a constant time per edge”, European Journal of Combinatorics, 16, no. 6, 1995, 617
- Antoine Deza, Michel Deza, Viatcheslav Grishukhin, “Fullerenes and coordination polyhedra versus half-cube embeddings”, Discrete Mathematics, 192, no. 1-3, 1998, 41
- Rory Turnbull, Sharon Peperkamp, 693, Complex Networks & Their Applications V, 2017, 83
- Мишель-Мари Деза, M Deza, Михаил Иванович Штогрин, Mikhail Ivanovich Shtogrin, “Изометрические вложения полуправильных многогранников, разбиений и им дуальных в гиперкубы и кубические решетки”, УМН, 51, no. 6, 1996, 199
- Joseph Berleant, Kristin Sheridan, Anne Condon, Virginia Vassilevska Williams, Mark Bathe, “Isometric Hamming embeddings of weighted graphs”, Discrete Applied Mathematics, 332, 2023, 119
- Hans-Jürgen Bandelt, Victor Chepoi, “Decomposition andl1-Embedding of Weakly Median Graphs”, European Journal of Combinatorics, 21, no. 6, 2000, 701