Some results in topological graph theory
β Scribed by R. J. Cook
- Publisher
- Springer Netherlands
- Year
- 1977
- Tongue
- English
- Weight
- 610 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0031-5303
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract A list of 31 problems presented here reflects some of the main trends in topological graph theory.
Attempts to solve the famous Four Color Problem led to fruitful discoveries and rich coloring theories. In this talk, some old and some recent applications of tools from topology to graph coloring problems will be presented. In particular, the following subjects will be treated: The use of Euler's f
I will mention two of my favourite problems in which recently important progress was made. The other questions I will mention are perhaps less well known. 1. Faber, Lowisz and I conjectured more than 20 years ago that if Gi, 1 <<.i~n are n G n edge disjoint complete graphs of size n then Ui=l i has