𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Universal Embedding Dimension of the Near Polygon on the 1-Factors of a Complete Graph

✍ Scribed by A. Blokhuis; A. E. Brouer

Book ID
111561774
Publisher
Springer
Year
1999
Tongue
English
Weight
34 KB
Volume
17
Category
Article
ISSN
0925-1022

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

The frame dimension and the complete ove
The frame dimension and the complete overlap dimension of a graph
✍ Jeffrey E. Steif πŸ“‚ Article πŸ“… 1985 πŸ› John Wiley and Sons 🌐 English βš– 715 KB

Roberts (F. S. Roberts, On the boxicity and cubicity of a graph. In Recent Progress in Cornbinarorics, W. T. Tutte, ed. Academic, New York (1 969)), studied the intersection graphs of closed boxes (products of closed intervals) in Euclidean n-space, and introduced the concept of the boxicity of a gr

A 1-factorization of the line graphs of
A 1-factorization of the line graphs of complete graphs
✍ Brian Alspach πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 254 KB πŸ‘ 1 views

## Abstract A 1‐factorization is constructed for the line graph of the complete graph __K~n~__ when __n__ is congruent to 0 or 1 modulo 4.