Realizing the chromatic numbers of triangulations of surfaces (Q1313860): Difference between revisions

For every closed 2-manifold \(S\) (whether orientable or nonorientable) and integer \(n\), \(3 \leq n \leq \chi(S)\), the chromatic number of \(S\), the authors construct a triangular imbedding of a graph \(G\) in \(S\) such that \(n=\chi(G)\), the chromatic number of \(G\).