The simplest known proof of the Map Color Theorem for nonorientable surfaces (obtained by Youngs, Ringel et al. and given in Ringel's book ''Map Color Theorem'') uses index one and three current graphs, and index two and three inductive constructions. We give another proof, still using current graph
A new solution for the nonorientable case 1 of the heawood Map Color Theorem
β Scribed by M Jungerman
- Publisher
- Elsevier Science
- Year
- 1975
- Tongue
- English
- Weight
- 127 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract In 1890, Heawood established the upper bound $H ( \varepsilon )= \left \lfloor 7+\sqrt {24\varepsilon +1}/{2}\right \rfloor$ on the chromatic number of every graph embedded on a surface of Euler genus Ξ΅ β₯ 1. Almost 80 years later, the bound was shown to be tight by Ringel and Youngs. Th
The analysis of cell hybrids between malignant mouse hepatoma cells and normal rat fibroblasts has previously demonstrated the critical role of a deletion in rat chromosome 5 (RNO5) that was related to an anchorage independent phenotype. Those hybrids that were anchorage independent displayed loss o