Three-coloring graphs embedded on surfaces with all faces even-sided
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.
scientific article; zbMATH DE number 798761