本文借助联树模型给出了一些已知结果的新证明,并证明了图类 的上可嵌入性,提供了求强 图 最大亏格的一个线性算法.
In this paper, armed with the joint-tree model, the new proof of some known results are provided. Furthermore, the graph , which is called polder in this paper, are proved to be upper embeddable,and a linear time algorithm for determining the maximum genus of strong-polder are offered as well.