Polyhexes that are \(\ell _1\) graphs
From MaRDI portal
Publication:1024308
DOI10.1016/j.ejc.2008.09.008zbMath1221.05110OpenAlexW1985021229MaRDI QIDQ1024308
Sergey V. Shpectorov, Michel Marie Deza
Publication date: 17 June 2009
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2008.09.008
Related Items (4)
\(l_1\)-embeddability under the edge-gluing operation on graphs ⋮ \(l_1\)-embeddability of shifted quadrilateral cylinder graphs ⋮ Embeddability of open-ended carbon nanotubes in hypercubes ⋮ \(l_1\)-embeddability of generic quadrilateral Möbius maps
Cites Work
- Unnamed Item
- Unnamed Item
- Cubic partial cubes from simplicial arrangements
- Partial cubes and their \(\tau\)-graphs
- Netlike partial cubes, IV: Fixed finite subgraph theorems
- On scale embeddings of graphs into hypercubes
- Recognition of the \(\ell_ 1\)-graphs with complexity \(O(nm)\), or Football in a hypercube
- Graphs \(4_n\) that are isometrically embeddable in hypercubes
- Distance and routing labeling schemes for non-positively curved plane graphs
- Espaces Métriques Plongeables Dans Un Hypercube: Aspects Combinatoires
This page was built for publication: Polyhexes that are \(\ell _1\) graphs