Proof of the squashed cube conjecture
From MaRDI portal
Cites work
Cited in
(25)- On the addressing problem for directed graphs
- Metric transforms of finite spaces and connected graphs
- A survey of the theory of hypercube graphs
- Representations of graphs and networks (coding, layouts and embeddings)
- Cover-preserving order embeddings into Boolean lattices
- Graph families with constant distance determinant
- Addressing the Petersen graph
- The geometry of graphs and some of its algorithmic applications
- A note on exact distance labeling
- Wiener index and addressing of the total graph
- Addressing graph products and distance-regular graphs
- Distance and routing labeling schemes for cube-free median graphs
- The near resolvable 2-(13,4,3) designs and thirteen-player whist tournaments
- Isometric universal graphs
- 4-hyperclique decompositions of 3-hyperdistance multihypergraphs of multipartite graphs
- Distance labeling schemes for cube-free median graphs
- Addressing Johnson graphs, complete multipartite graphs, odd cycles, and random graphs
- scientific article; zbMATH DE number 2230282 (Why is no real title available?)
- Wiener index and addressing of some finite graphs
- Transforming quantified Boolean formulas using biclique covers
- Spectra of variants of distance matrices of graphs and digraphs: a survey
- Distance labeling for families of cycles
- Boolean autoencoders and hypercube clustering complexity
- Isometric embedding in products of complete graphs
- Clique partitions of distance multigraphs
This page was built for publication: Proof of the squashed cube conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1055790)
