✦ LIBER ✦
Three-Coloring Graphs Embedded on Surfaces with All Faces Even-Sided
✍ Scribed by J.P. Hutchinson
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 765 KB
- Volume
- 65
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
✦ Synopsis
Every graph embedded on a surface of positive genus with every face bounded by an even number of edges can be 3-colored provided all noncontractible cycles in the graph are sufficiently long. The bound of three colors is the smallest possible for this type of result. 1995 Academic Press. Inc.