Separation and dimension in a graph
β Scribed by Francis Buekenhout
- Publisher
- Springer
- Year
- 1979
- Tongue
- English
- Weight
- 99 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0046-5755
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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 graph is a pair (V, I), V being the vertices and I being the relation of adjacency on V. Given a grqh G, then a collection of functions (fi}~ ,, each fi mapping each vertex of V into an arc on a fixed circle, is said to define an m-arc intersection model for G if for all x, y E V, xly e=, (Vi~ml(f
## Abstract The concepts of __separation index__ of a graph and of a surface are introduced. We prove that the separation index of the sphere is 3. Also the separation index of any graph faithfully embedded in a surface of genus __g__ is bounded by a funtion of __g__. Β© 2002 Wiley Periodicals, Inc.