Recognition of the \(\ell_ 1\)-graphs with complexity \(O(nm)\), or Football in a hypercube
From MaRDI portal
Publication:1911847
DOI10.1006/eujc.1996.0024zbMath0854.05093OpenAlexW1528683952MaRDI QIDQ1911847
Sergey V. Shpectorov, Michel Marie Deza
Publication date: 13 January 1997
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/eujc.1996.0024
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (12)
Clin d'oeil on \(L_1\)-embeddable planar graphs ⋮ \(l_1\)-embeddability under the edge-gluing operation on graphs ⋮ \(l_1\)-embeddability of shifted quadrilateral cylinder graphs ⋮ Isometric Hamming embeddings of weighted graphs ⋮ Distance-preserving subgraphs of Johnson graphs ⋮ Embeddings of chemical graphs in hypercubes ⋮ Polyhexes that are \(\ell _1\) graphs ⋮ \(l_1\)-embeddability of generic quadrilateral Möbius maps ⋮ Hypercube emulation of interconnection networks topologies ⋮ Fullerenes and coordination polyhedra versus half-cube embeddings ⋮ Complementary \(l_1\)-graphs ⋮ Complementary \(\ell_1\)-graphs embeddable in the half-cube
This page was built for publication: Recognition of the \(\ell_ 1\)-graphs with complexity \(O(nm)\), or Football in a hypercube
