3-Coloring graphs embedded in surfaces

@article{Zhao20003ColoringGE,
  title={3-Coloring graphs embedded in surfaces},
  author={Yue Zhao},
  journal={Journal of Graph Theory},
  year={2000},
  volume={33},
  pages={140-143}
}
In this article, we show that there exists an integer k(Σ) ≥ 5 such that, if G is a graph embedded in a surface Σ without i-circuits, 4 ≤ i ≤ k(Σ), then G is 3-colorable. c © 2000 John Wiley & Sons, Inc. J Graph Theory 33: 140–143, 2000