Respected readers, authors and reviewers, you can add comments to this page on any questions about the contribution, review, editing and publication of this journal. We will give you an answer as soon as possible. Thank you for your support!
The research of coloring graphs on surfaces originated
from Heawood map color theorem. With an analysis based on the
primary source, we survey the work of Thomassen, such as three color
theorem and list coloring, coloring graphs on surfaces, and
chromatic polynomial and number of colorings. His work
has been concerned by many mathematicians, such as Mohar, Thomas and Hutchinson.
{[1]} MOHAR B, THOMASSEN C. Graphs on Surfaces [M]. London: Johns Hopkins University Press, 2001.{[2]} BEINEKE L W, WILSON R J. Topics in Topological Graph Theory [M]. London: Cambridge University Press, 2009.{[3]} JENSEN T, TOFT B. Graph coloring problems [M]. New York: John Wiley, 1995.{[4]} HUTCHINSON J P. Automorphism properties of embedded graphs [J]. J Graph Theory, 1984, 8: 35-49.