Polyhexes that are l1 graphs

Authors:
M. Deza;S. Shpectorov
Affiliations:
Ecole Normale Superieure, 45, rue d'Ulm, F-75230 Paris Cedex 05, France and JAIST, 1-1 Asahidai, Nomi, Ishikawa 923-1292, Japan;School of Mathematics, University of Birmingham, Edgbaston, Birmingham, B15 2TT, United Kingdom
Venue:
European Journal of Combinatorics
Year:
2009

Citing 5
Cited 1

On scale embeddings of graphs into hypercubes

European Journal of Combinatorics
Recognition of the l1-graphs with complexity O(nm), or football in a hypercube

European Journal of Combinatorics - Special issue on discrete metric spaces
Distance and routing labeling schemes for non-positively curved plane graphs

Journal of Algorithms
Partial cubes and their τ-graphs

European Journal of Combinatorics
Netlike partial cubes, IV: Fixed finite subgraph theorems

European Journal of Combinatorics

Embeddability of open-ended carbon nanotubes in hypercubes

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A connected graph is said to be @?"1 if its path distance isometrically embeds into the space @?"1. Following the work of Deza, Grishukhin, Shtogrin, and others on polyhedral @?"1 graphs, we determine all finite closed polyhexes (trivalent surface graphs with hexagonal faces) that are @?"1.