Recognizing halved cubes in a constant time per edge

DOI10.1016/0195-6698(95)90042-XzbMath0842.05026OpenAlexW2147020261MaRDI QIDQ1902967

Wilfried Imrich, Sandi Klavžar, Aleksander Vesel

Publication date: 17 July 1996

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0195-6698(95)90042-x

zbMATH Keywords

algorithmembeddingmetric spacerecognition\(l_ 1\)-graphshalved cubes

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distance-regular graphs and halved graphs
• On the complexity of testing a graph for n-cube
• On scale embeddings of graphs into hypercubes
• \(\ell_ 1\)-rigid graphs
• Faster isometric embedding in products of complete graphs
• On Isometric Embeddings of Graphs
• Product graph representations
• HYPERMETRIC GRAPHS

This page was built for publication: Recognizing halved cubes in a constant time per edge