A simple proof of the generalization of Israel's theorem
โ Scribed by D. C. Robinson
- Publisher
- Springer US
- Year
- 1977
- Tongue
- English
- Weight
- 157 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0001-7701
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
This article gives a simple proof of a result of Moser, which says that, for any rational number r between 2 and 3, there exists a planar graph G whose circular chromatic number is equal to r.
## Abstract A proof of Menger's theorem is presented.
## Abstract For a simple graph of maximum degree ฮ, it is always possible to color the edges with ฮ + 1 colors (Vizing); furthermore, if the set of vertices of maximum degree is independent, ฮ colors suffice (Fournier). In this article, we give a short constructive proof of an extension of these re