Proof of the squashed cube conjecture

DOI10.1007/BF02579350zbMath0522.05064WikidataQ123133222 ScholiaQ123133222MaRDI QIDQ1055790

Peter M. Winkler

Publication date: 1983

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

Hamming distancelabelled graphsdistance-preserving embeddingsquashed cube

Mathematics Subject Classification ID

Graph theory (05C99) Absolute neighborhood retracts (55M15)

Related Items

Graph families with constant distance determinant, Addressing the Petersen graph, The geometry of graphs and some of its algorithmic applications, A survey of the theory of hypercube graphs, Wiener index and addressing of some finite graphs, A note on exact distance labeling, Distance and routing labeling schemes for cube-free median graphs, Representations of graphs and networks (coding, layouts and embeddings), Clique partitions of distance multigraphs, Wiener index and addressing of the total graph, Addressing Johnson Graphs, Complete Multipartite Graphs, Odd Cycles, and Random Graphs, Unnamed Item, Boolean autoencoders and hypercube clustering complexity, Cover-preserving order embeddings into Boolean lattices, The near resolvable \(2\)-\((13,4,3)\) designs and thirteen-player whist tournaments, Addressing graph products and distance-regular graphs, Unnamed Item, Unnamed Item, Isometric Universal Graphs, Isometric embedding in products of complete graphs, On the addressing problem for directed graphs, Metric transforms of finite spaces and connected graphs

Cites Work

• Unnamed Item
• Every connected graph is a query graph
• On the Loop Switching Addressing Problem
• On the Addressing Problem for Loop Switching