Pages that link to "Item:Q1911847"
From MaRDI portal
The following pages link to Recognition of the \(\ell_ 1\)-graphs with complexity \(O(nm)\), or Football in a hypercube (Q1911847):
Displaying 14 items.
- \(l_1\)-embeddability under the edge-gluing operation on graphs (Q390281) (← links)
- Polyhexes that are \(\ell _1\) graphs (Q1024308) (← links)
- \(\ell_ 1\)-rigid graphs (Q1321589) (← links)
- Clin d'oeil on \(L_1\)-embeddable planar graphs (Q1377613) (← links)
- Fullerenes and coordination polyhedra versus half-cube embeddings (Q1584443) (← links)
- Complementary \(l_1\)-graphs (Q1584449) (← links)
- Distance-preserving subgraphs of Johnson graphs (Q1743174) (← links)
- Complementary \(\ell_1\)-graphs embeddable in the half-cube (Q1864619) (← links)
- Recognizing halved cubes in a constant time per edge (Q1902967) (← links)
- \(l_1\)-embeddability of generic quadrilateral Möbius maps (Q2311380) (← links)
- Isometric Hamming embeddings of weighted graphs (Q2696622) (← links)
- Hypercube emulation of interconnection networks topologies (Q2831031) (← links)
- Embeddings of chemical graphs in hypercubes (Q5941990) (← links)
- \(l_1\)-embeddability of shifted quadrilateral cylinder graphs (Q6184153) (← links)
