Polyhexes that are _1 graphs
A graph \(\Gamma\) is an \(\ell_1\) graph if the vertices of \(\Gamma\) can be matched with some points of \(\ell_1\) in such a way that the path distance between every two vertices of \(\Gamma\) is equal to the distance between the corresponding two points of \(\ell_1\). A polyhex is a finite trivalent surface graph \(\Gamma\) drawn on a surface \(S\) in such a way that every face is a hexagon. The authors determine all polyhexes that are \(\ell_1\) as follows: If \(\Gamma\) is an \(\ell_1\) polyhex then either \(\Gamma\) is the so-called prism polyhex \(\Gamma_{2n}\), \(n\geq 3\), or one of the four sporadic examples.
- Cubic partial cubes from simplicial arrangements
- Distance and routing labeling schemes for non-positively curved plane graphs
- Espaces Métriques Plongeables Dans Un Hypercube: Aspects Combinatoires
- Graphs \(4_n\) that are isometrically embeddable in hypercubes
- scientific article; zbMATH DE number 2108391 (Why is no real title available?)
- Netlike partial cubes, IV: Fixed finite subgraph theorems
- On scale embeddings of graphs into hypercubes
- Partial cubes and their \(\tau\)-graphs
- Recognition of the \(\ell_ 1\)-graphs with complexity \(O(nm)\), or Football in a hypercube
- Tribes of cubic partial cubes
- Complementary _1-graphs embeddable in the half-cube
- Embeddability of open-ended carbon nanotubes in hypercubes
- \(l_1\)-embeddability of generic quadrilateral Möbius maps
- \(l_1\)-embeddability under the edge-gluing operation on graphs
- l₁-embeddability of hexagonal and quadrilateral Möbius graphs.
- l₁-embeddability of shifted quadrilateral cylinder graphs
- l₁-embeddability under the edge-gluing operation on some nonbipartite 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)
