一类特殊图的上可嵌入性

Upper Embeddability of a Kind of Special Graph

自从Nordhaus等引入图的最大亏格以来,图的最大亏格以及图的上可嵌入引起了广泛关注.关于图的上可嵌入性,刘彦佩和Nebseky分别给出不同形式的充要条件;主要讨论了一类特殊图上可嵌入性即满足大次和条件图的上可嵌入性,证明一类大次和条件图是上可嵌入性.

Since the introductory investigation of maximum genus by E. Nordhaus, B. Stewart and A. White, the upperembeddability of graphs has been paid great attention so far. Y · Liu and L · Nebseky have respectively given a sufficient and necessary condition on upper embeddable graphs. In the paper, we mainly investigate the upper embeddability of a kind of special graph and prove a graph which satisfies specific degree-sum is upper embeddable.