Faster isometric embedding in products of complete graphs

DOI10.1016/0166-218X(94)90154-6zbMath0808.05086MaRDI QIDQ1329794

V. Pereyra

Publication date: 9 March 1995

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Hamming graphisometric embeddingproduct of complete graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Recognizing halved cubes in a constant time per edge ⋮ Recognizing median graphs in subquadratic time

Cites Work

• Computing equivalence classes among the edges of a graph with applications
• Isometric embedding in products of complete graphs
• Isometric embeddings in Hamming graphs
• Retracts of hypercubes
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Faster isometric embedding in products of complete graphs