Dispersed points and geometric embedding of complete bipartite graphs
From MaRDI portal
(Redirected from Publication:807631)
Recommendations
Cites work
- Contact patterns of equal nonoverlapping spheres
- Convex bodies forming pairs of constant width
- Embedding of trees in Euclidean spaces
- Embedding the n-cube in lower dimensions
- Geometrical embeddings of graphs
- On the contact dimensions of graphs
- On the sphericity and cubicity of graphs
- On the sphericity for the join of many graphs
- On the sphericity of the graphs of semiregular polyhedra
- Space graphs and sphericity
- Sphericity exceeds cubicity for almost all complete bipartite graphs
Cited in
(9)- On the complexity of closest pair via polar-pair of point-sets
- On the complexity of closest pair via polar-pair of point-sets
- Annulus graphs in \(\mathbb{R}^d\)
- On the sphericity and cubicity of graphs
- Sphericity exceeds cubicity for almost all complete bipartite graphs
- On closest pair in Euclidean metric: monochromatic is as hard as bichromatic
- A few applications of negative-type inequalities
- Monotone maps, sphericity and bounded second eigenvalue
- Proof of Schur's conjecture in \(\mathbb R^D\)
This page was built for publication: Dispersed points and geometric embedding of complete bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q807631)