Contact patterns of equal nonoverlapping spheres

DOI10.1007/BF02582952zbMath0581.05022OpenAlexW2037911660MaRDI QIDQ1068097

Hiroshi Maehara

Publication date: 1985

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02582952

zbMATH Keywords

contact dimensioncontact patterndispersed set

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial aspects of packing and covering (05B40)

Related Items

On the Complexity of Closest Pair via Polar-Pair of Point-Sets, On the Euclidean dimension of a complete multipartite graph, Intersection graphs for families of balls in \(R^n\), The coordinate representation of a graph and \(n\)-universal graph of radius 1, On the contact dimensions of graphs, On the Complexity of Closest Pair via Polar-Pair of Point-Sets, Dispersed points and geometric embedding of complete bipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Embedding the n-cube in lower dimensions
• Space graphs and sphericity
• Extremal f-trees and embedding spaces for molecular graphs
• Auf welcher Kugel haben 5, 6, 7, 8 oder 9 Punkte mit Mindestabstand Eins Platz?
• On the dimension of a graph
• The Closest Packing of Spherical Caps in n Dimensions