Non-Separating Embeddings of Graphs in Closed Surfaces
暂无分享,去创建一个
This term the seminar is dedicated to students who want to do research, and to faculty who want to jump in and help generate ideas. The emphasis is on interaction and generating new ideas. Speakers should prepare clear and simple presentations of basic underlying ideas. Technical prowess is appreciated when alluded at, but less so when expounded and insisted upon. More than the details of any single proof or calculation, we aim to understand the principles underpinning those.
[1] James R. Munkres,et al. Elements of algebraic topology , 1984 .
[2] Gerhard Ringel,et al. The combinatorial map color theorem , 1977, J. Graph Theory.
[3] Saul Stahl,et al. Generalized Embedding Schemes , 1978, J. Graph Theory.
[4] Ladislav Nebeský,et al. A new characterization of the maximum genus of a graph , 1981 .
[5] Nguyen Huy Xuong,et al. How to determine the maximum genus of a graph , 1979, J. Comb. Theory, Ser. B.