𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the contact dimensions of graphs

✍ Scribed by P. Frankl; H. Maehara

Publisher
Springer
Year
1988
Tongue
English
Weight
317 KB
Volume
3
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Graphs of small dimensions
Graphs of small dimensions
✍ Nancy Eaton; VojtΔ›ch RΓΆdl πŸ“‚ Article πŸ“… 1996 πŸ› Springer-Verlag 🌐 English βš– 926 KB
The Decomposition Dimension of Graphs
The Decomposition Dimension of Graphs
✍ Gary Chartrand; David Erwin; Michael Raines; Ping Zhang πŸ“‚ Article πŸ“… 2001 πŸ› Springer Japan 🌐 English βš– 100 KB
On a product dimension of bipartite grap
On a product dimension of bipartite graphs
✍ S. Poljak; D. RΓΆdl; A. Pultr πŸ“‚ Article πŸ“… 1983 πŸ› John Wiley and Sons 🌐 English βš– 437 KB πŸ‘ 1 views
The dimension of sums of graphs
The dimension of sums of graphs
✍ Peter Alles πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 235 KB

For a graph G, dim G is defined to be the least natural number n such that G is an induced subgraph of a categorial (or direct) product of n complete graphs. The dimension of sums of graphs has been studied in [3] and [8]. The aim if this article is to improve the upper estimates achieved by Poljak

On the euclidean dimension of a complete
On the euclidean dimension of a complete multipartite graph
✍ Hiroshi Maehara πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 272 KB

The euclidean dimension of a graph G, e(G), is the minimum n such that the vertices of G can be placed in euclidean n-space, R", in such a way that adjacent vertices have distance 1 and nonadjacent vertices have distances other than 1. Let G = K(n,, . , ns+,+J be a complete (s + t + u)-partite graph