Dispersed points and geometric embedding of complete bipartite graphs
From MaRDI portal
Publication:807631
DOI10.1007/BF02574674zbMATH Open0731.05015OpenAlexW2082052321MaRDI QIDQ807631FDOQ807631
Authors: H. Maehara 
Publication date: 1991
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131143
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75)
Cites Work
- Space graphs and sphericity
- On the sphericity and cubicity of graphs
- Convex bodies forming pairs of constant width
- Geometrical embeddings of graphs
- On the contact dimensions of graphs
- Contact patterns of equal nonoverlapping spheres
- Embedding the n-cube in lower dimensions
- On the sphericity for the join of many graphs
- Sphericity exceeds cubicity for almost all complete bipartite graphs
- On the sphericity of the graphs of semiregular polyhedra
- Embedding of trees in Euclidean spaces
Cited In (9)
- Annulus graphs in \(\mathbb{R}^d\)
- On closest pair in Euclidean metric: monochromatic is as hard as bichromatic
- A few applications of negative-type inequalities
- Proof of Schur's conjecture in \(\mathbb R^D\)
- On the sphericity and cubicity of graphs
- Sphericity exceeds cubicity for almost all complete bipartite graphs
- On the complexity of closest pair via polar-pair of point-sets
- On the complexity of closest pair via polar-pair of point-sets
- Monotone maps, sphericity and bounded second eigenvalue
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)
