Affiliation:
1. School of Mathematics and Statistics, Beijing Jiaotong University, Shangyuancun 3, Beijing 100044, China
Abstract
The problem of determining the genus for a graph can be dated to the Map Color Conjecture proposed by Heawood in 1890. This was implied to be a Thread Problem by Hilbert and Cohn-Vossen. The conjecture was finally established by Ringel, Youngs, and many other mathematicians. Subsequently, the genera of some special graphs with symmetry were determined. The study of genus embeddings of graphs is closely related to other invariants of a graph. Specifically, the computational complexity is dependent on the genus of the underlying graph for certain well-known NP-hard problems. In this survey, main construction techniques and certain criteria are stated in the topic of the genus of a graph. Most graphs with a known genus are listed. A new theorem is shown that the method of joint trees of a graph is reasonable. Moreover, a formal set is introduced, and related results are obtained. Although a cubic graph of Hamilton cycle is asymmetric, it is interesting that a set of associate surfaces of all its joint trees is a formal set with symmetry.
Subject
Physics and Astronomy (miscellaneous),General Mathematics,Chemistry (miscellaneous),Computer Science (miscellaneous)
Reference80 articles.
1. Map colour theorem;Heawood;Quart. J. Math.,1890
2. Every planar map is four colourable, Part I: Discharging;Appel;J. Ill. Math.,1977
3. Hilbert, D., and Cohn-Vossen, S. (1952). Geometry and the Imagination, Chelsea Publishing Company.
4. Ringel, G. (1974). Map Color Theorem, Springer.
5. The graph genus problem is NP-complete;Thomassen;J. Algorithms,1989