Polyhexes that are _1 graphs
From MaRDI portal
Publication:1024308
DOI10.1016/J.EJC.2008.09.008zbMATH Open1221.05110OpenAlexW1985021229MaRDI QIDQ1024308FDOQ1024308
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Cubic partial cubes from simplicial arrangements
- 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
- Espaces Métriques Plongeables Dans Un Hypercube: Aspects Combinatoires
- Title not available (Why is that?)
- Netlike partial cubes, IV: Fixed finite subgraph theorems
- Partial cubes and their \(\tau\)-graphs
- Distance and routing labeling schemes for non-positively curved plane graphs
Cited In (5)
- Complementary \(\ell_1\)-graphs embeddable in the half-cube
- Embeddability of open-ended carbon nanotubes in hypercubes
- \(l_1\)-embeddability of shifted quadrilateral cylinder graphs
- \(l_1\)-embeddability of generic quadrilateral Möbius maps
- \(l_1\)-embeddability under the edge-gluing operation on graphs
This page was built for publication: Polyhexes that are \(\ell _1\) graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024308)