Collapse of the metric hierachy for bipartite graphs
European Journal of Combinatorics
Isometric embeddings in Hamming graphs
Journal of Combinatorial Theory Series B
Antipodal graphs and oriented matroids
Discrete Mathematics
A note on l1-rigid planar graphs
European Journal of Combinatorics - Special issue on discrete metric spaces
Clin d'oeil on L1-embeddable planar graphs
Discrete Applied Mathematics - Special issue: 50th anniversary of the Wiener index
Wiener number of vertex-weighted graphs and a chemical application
Discrete Applied Mathematics - Special issue: 50th anniversary of the Wiener index
Partial cubes as subdivision graphs and as generalized Petersen graphs
Discrete Mathematics
Geometry of Cuts and Metrics
Subdivided graphs as isometric subgraphs of Hamming graphs
European Journal of Combinatorics
Hi-index | 0.05 |
The k-wheel Wk is the graph obtained as a join of a vertex and the cycle of length k. It is proved that a subdivided wheel G embeds isometrically into a hypercube if and only if G is the subdivision graph S(K4) of K4 or G is obtained from the wheel Wk (k ≥ 3) by subdividing any of its outer-edges with an odd number of vertices.