Dispersed points and geometric embedding of complete bipartite graphs
From MaRDI portal
Publication:807631
DOI10.1007/BF02574674zbMath0731.05015OpenAlexW2082052321MaRDI QIDQ807631
Publication date: 1991
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131143
Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75)
Related Items
Sphericity exceeds cubicity for almost all complete bipartite graphs, A few applications of negative-type inequalities, On the Complexity of Closest Pair via Polar-Pair of Point-Sets, On closest pair in Euclidean metric: monochromatic is as hard as bichromatic, Proof of Schur's conjecture in \(\mathbb R^D\), On the Complexity of Closest Pair via Polar-Pair of Point-Sets, Monotone maps, sphericity and bounded second eigenvalue
Cites Work
- On the contact dimensions of graphs
- Embedding the n-cube in lower dimensions
- Space graphs and sphericity
- On the sphericity and cubicity of graphs
- On the sphericity for the join of many graphs
- Convex bodies forming pairs of constant width
- Contact patterns of equal nonoverlapping spheres
- On the sphericity of the graphs of semiregular polyhedra
- Sphericity exceeds cubicity for almost all complete bipartite graphs
- Embedding of trees in Euclidean spaces
- Geometrical embeddings of graphs
